WO2006136487A1 - Procede de resolution de nom et serveur correspondant - Google Patents

Procede de resolution de nom et serveur correspondant Download PDF

Info

Publication number
WO2006136487A1
WO2006136487A1 PCT/EP2006/062769 EP2006062769W WO2006136487A1 WO 2006136487 A1 WO2006136487 A1 WO 2006136487A1 EP 2006062769 W EP2006062769 W EP 2006062769W WO 2006136487 A1 WO2006136487 A1 WO 2006136487A1
Authority
WO
WIPO (PCT)
Prior art keywords
name
address
addresses
name resolution
resolution server
Prior art date
Application number
PCT/EP2006/062769
Other languages
German (de)
English (en)
Inventor
Di Zhou
Cornelia Kappler
Original Assignee
Nokia Siemens Networks Gmbh & 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 & Co. Kg filed Critical Nokia Siemens Networks Gmbh & Co. Kg
Publication of WO2006136487A1 publication Critical patent/WO2006136487A1/fr

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00Network arrangements, protocols or services for addressing or naming
    • H04L61/45Network directories; Name-to-address mapping
    • H04L61/4505Network directories; Name-to-address mapping using standardised directories; using standardised directory access protocols
    • H04L61/4511Network directories; Name-to-address mapping using standardised directories; using standardised directory access protocols using domain name system [DNS]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00Network arrangements, protocols or services for addressing or naming
    • H04L61/45Network directories; Name-to-address mapping
    • H04L61/4552Lookup mechanisms between a plurality of directories; Synchronisation of directories, e.g. metadirectories
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/51Discovery or management thereof, e.g. service location protocol [SLP] or web services

Definitions

  • the invention relates to a method for name resolution.
  • name resolution is generally referred to the process of finding a name in a distributed system with multiple interconnected computers, that is, the resolution of the name in an address.
  • address a parameter or set of parameters that allows for precise localization. So an address for the purposes of vorlie ⁇ constricting application may be provided for example by the combination of an IP (Internet Protocol) address and a port number.
  • DNS Domain Name System
  • WWW World Wide Web
  • is in a name such as the name used for the World Wide Web (WWW) www.siemens.com in the address of the corresponding Web page resolved-providing server.
  • WWW World Wide Web
  • This approach is advantageous because it is usually easier for people to remember a name such as www.siemens.com as an address constructed from a bit string or many digits.
  • the use of names in distributed systems offers the advantage of not only enabling simple but also flexible identification of a resource that is to be addressed.
  • a resource can be more generally to various, frequently ⁇ fig act nen also called entity (Entity) objects or Perso ⁇ which can communi ⁇ cate via communication networks such as the Internet and digital mobile networks with each other and connect.
  • entities include computers, peripherals in the form of printers, users, mailboxes, messages or even files.
  • the name is www.siemens.com dissolved such that first, the so-called root server or root name resolution server resolves the partial name "com” into the address of the name resolution server responsible for "com.” The remaining partial names "www. siemens” are then used by the root server sent to the name resolution server responsible for "com", which in turn determines the address of the "siemens" name resolution sungs Servers to which the remaining part name "www” was sent becomes.
  • the name resolution server responsible for "siemens” can now resolve the last partial name "www” into an address, via which the corresponding WWW page, for example, can be called up.
  • Name resolution distinguishes two basic different approaches, which are referred to as the iterative name resolution method or as the recursive name resolution method.
  • the iterative name resolution method is characterized in that by the different involved in the name resolution Na mens resolution-server (which is typically referred to as a name server or name resolution server who ⁇ ) each intermediate result, ie the result of the Na ⁇ mens resolution of each individual Part name, to the requesting client. This is then able ba ⁇ sierend on the intermediate result, ie the address of the next to questioning name resolution server that or in the hierarchy following part names in a request to this next name resolution server to send.
  • recursive name resolution does not return every intermediate result to the requesting client. Instead, the unresolved subnames are forwarded directly to the next name resolution server.
  • a method is known to be associated with the so-called general service name ( "Generic Service Names") in differing ⁇ chen wireless networks different IP addresses for providing information.
  • This makes it possible that a mobile device is provided in response to a request of a connected with a general service name information resource in a first wireless network an IP address for a first information provider, while another wireless network ⁇ plant in response to the same general service name an IP
  • a general service name of the top level can be composed of a plurality of hierarchically arranged levels of general service names.
  • the invention has for its object to provide a particularly le ⁇ viable method for name resolution.
  • This object is achieved by a method for resolving a name in a destination address or in destination addresses, in which by a first name resolution server a. in a first request message, an application receives an underdetermined name, which consists of an underpart of name or of several partial names, of which at least one is sub-determined, b. of the according to a predetermined order Festge ⁇ put first part name of the certain name is dissolved in a first address or the first address, cl., the first request message by sending the first address as the destination address or the first address as the destination addresses to the Application is answered, if the undermony name is completely dissolved, or otherwise c2.
  • a first address or at least one of the first addresses is selected and is sent from the not yetvullös ⁇ th name of the certain name of existing radical name for further resolution by at least a second name resolution server in a second request message to the at least one selected first address , d2. following the steps a., b. and c2. corresponding steps with the respective formed remainder name are repeated as long as ⁇ until, by means of this recursive method in case of successful resolution of the name in a step corresponding to step cl. the first request message by the Sending the determined from the predetermined according to the predetermined order last partial name destination address or the destination addresses so determined is answered to the application.
  • a name contains the insufficient or ambiguous information, so according to the known methods for Namensauf ⁇ solution no unique determination of a destination address is possible.
  • An under certain name contains thereby at least ei ⁇ nen under certain part name.
  • any type of hardware or software applications is called, which can send a request message to a name ssolution ⁇ server. Examples include computers, application server, communication terminals, anfra ⁇ term name resolution server or communication programs.
  • a communication program for example, by a simple interface for command input, which is also referred to as "Command Line Interface" be given.
  • the destination address a ⁇ Pa ket Scheme approximately in the form of a (optionally combined with a port number) used IP address.
  • the destination address does not necessarily mean that the resource must be identified. While this is in the currently used IP addressesierierwei ⁇ se the case, as this tion supporting such resource normally both the iden ⁇ and the location information needed for routing contain (d. H. the indication of which "way" the appropriate resource who can reach ⁇ ). for others, especially future ways of addressing, for the inventive method for Na However, if this resolution is also applicable, this need not be the case.
  • the recursive inventive method of name resolution is preferred because it allows a certain under ⁇ Na me, usually server sung may be dissolved in cooperation of several Namensauflö-.
  • the underdetermined name is made up of an underpart or a plurality of subnames, at least one of which is underdetermined.
  • the sub-definiteness of the name is given in particular from the point of view of the application, that is, no name is known to it which uniquely identifies the desired destination address or the desired destination addresses.
  • the under certain name in a target address or in multiple destination addresses are resolved. This makes it possible for requests that can not be successfully processed in the known name resolution methods to be successfully answered with a message containing a destination address or several destination addresses. It is crucial that under certain name or under certain partial name can in fact be delivered ⁇ and the name resolution server or name resolution servers are processed.
  • the successful processing of a subpart name by a name resolution server can be done in different ways.
  • the name resolution server can do a database search in an internal or external database or Use the search engine to determine at least one address from the partial name. Due to the fact that several first addresses are permitted as the result, in the next step, ie in the resolution of the next partial name corresponding to the predetermined sequence, several ers ⁇ te addresses may be available, to which a second request message can be sent. Which of the specific first addresses ultimately leads to a successful resolution of the underdetermined name thus often results only after the resolution of a following partial name or of several following partial names.
  • the inventive method can be taltet preferably kepts ⁇ , is that the first or second request message from the first and second name resolution server in case of failure of the resolution of the certain name and the residual name responds by sending an error message be ⁇ .
  • This embodiment is preferred because it allows the requesting application to promptly respond to the failure of the resolution of the underdetermined name or the remainder name. Unnecessary waiting times are ⁇ on the part of the application avoided.
  • the inventive method can preferably also run from ⁇ so that in step c2. unselected first addresses are stored by the first name resolution server in a memory device. The storing of the non-selected first addresses by the first name resolution server is preferred because these first addresses are held in this way for later use.
  • the inventive method is removablebil ⁇ det that the error message message of the second name- saufliess server is received from the first name resolution server and in the presence of at least one previously not yet selected first address from the memory device, the previously not yet selected first address or at least one of the previously not yet selected first addresses is selected and the remaining name for Na ⁇ mensaufans by at least one further second name resolution server from the first name resolution server to the at least one further selected first address gesen ⁇ det is.
  • the storage means of the first name resolution server it is preferable that if a first selected first address does not result in a resolution of the underdetermined name, further first addresses may be used, thereby increasing the likelihood of successful name resolution of the underdetermined name increased significantly.
  • step c2. which selects a first address or one of the first addresses from the first name resolution server.
  • step c2. which selects a first address or one of the first addresses from the first name resolution server.
  • the first addresses are selected one after the other and the second request message with the remaining name consisting of the as yet unresolved partial names of the underdetermined name is in each case sent to only one selected first address.
  • This exporting ⁇ approximate shape of the inventive method is preferred since this unnecessary message traffic is avoided.
  • the inventive method can also be so ablau ⁇ fen that in the presence of more than one first address in step c2. from the first name resolution server, several or all of the first addresses are selected and the second request message is sent simultaneously to all selected first addresses.
  • the resolution of the certain name and the residual name to be determined comprises an indication of the number of target addresses.
  • the application the first name resolution server this enables or to inform the number of ge ⁇ desired destination addresses.
  • the application can specify that only exactly one destination address is to be determined as a result of the name resolution.
  • a maximum of five destination addresses can be requested or a range of values for the number of destination addresses to be determined can be specified.
  • the object on which the invention is based is moreover achieved according to the invention by a method for dissolution a name to a destination address or destination addresses from a first name resolution server a.
  • an application receives an underdetermined name, which consists of an underpart of name or of several partial names, of which at least one is sub-determined, b. is the corresponding to a predetermined order Festge ⁇ put first part name of the certain name in a first address or addresses in first dissolved c.
  • the first request message by sending the first Ad ⁇ ress or the first address is answered to the application, whereupon dl.
  • the first address is used by the application as the destination address or the first addresses are used as destination addresses when the subordinate name is completely resolved, or otherwise d2.
  • a first address or Minim ⁇ is least selected one of the first addresses of the application and an existing from the still resolution sub name of the certain name radical name for further resolution by at least a second name resolution server in a second request message to the at least one selected first Address is sent, e2. whereupon steps a., b., c. and d2. corresponding steps with the remainder name formed in each case are repeated as long as ⁇ until this iterative method in successive ⁇ resolution of the name in a the step dl. entspre ⁇ chendem step is terminated.
  • this method is an iterative method, which thus deviates from the recursive method according to the invention for the purpose of resolving an underdetermined name into a destination address or destination addresses. differs.
  • the basic feature of an iterative method of name resolution is as already explained that the result of the liquidation of a name will ever ⁇ wells sent back to the application.
  • the Applikati ⁇ on this advantageously allows the control of each individual step ⁇ the name resolution.
  • the inventive iterative method for Na ⁇ mensaufains offers the advantage that for the first name resolution server (and accordingly also for the other involved in the name resolution name resolution server) eliminates the need after answering the first request ⁇ message first addresses to store or other computer resources vorzuhalten. This is not necessary since all addresses determined from the first name of the name can be returned to the application.
  • iterative method of the invention may be configured such that the first and secondthrenach ⁇ indicative of the first and second name resolution server in case of failure of the resolution of the certain name and the remaining name is answered message by sending an error message ⁇ .
  • the application by sending an error message message allows the failure of a particular step to respond to the name resolution.
  • the iterative method according to the invention is preferably so pronounced that in step d2.
  • unselected first Ad ⁇ ests from the application in a memory device are stored.
  • the storing of the non-selected first addresses in a memory device is advantageous since these Addresses are thus for possible future use vorgehal ⁇ th. This is particularly advantageous if the first selected first address or the initially selected first ⁇ addresses do not lead to a successful name resolution of certain name.
  • the inventive method can also run as from ⁇ that the error message of the first or second name resolution server is received by the application and in the presence of at least one not previously selected first and second address from the storage device which has not been previously selected first or second address or at least one of the previously not yet selected first or second addresses is selected and the name or the rest name for name resolution by at least one other first or second name resolution server from the application to the at least one further selected first or second address is sent.
  • ite ⁇ rative method of the invention can take place so that one or more further first and second addresses with which the method of name resolution is continued to be selected at the failure of the name resolution by using one or more first or second address. This significantly increases the likelihood of a successful name resolution, while on the other hand not necessarily all first or second addresses must be used simultaneously for the name resolution, which in turn would bring disadvantages in terms of the number of messages exchanged.
  • step d2 in step d2. the first address or exactly one of the first addresses selected by the application. This corresponds to a sequential implementation of the method according to the invention, which advantageously minimizes the number of request messages to be sent.
  • iterative method of the invention before ⁇ may preferably also take place so that in the presence of more than one first address in step d2.
  • several or all of the first addresses are selected by the application and the second request message is simultaneously sent to all selected first addresses.
  • the inventive recursive method is Rens increased by the selection of several or all of the first address and the consequent simultaneous sending the second request message to more than one first address, the speed of flow of the procedural ⁇ invention.
  • the inventive method can also take place so ⁇ that the first and / or the second request message includes an indication of the number of resolution as a result of the under certain name or the name of the radical to be determined destination addresses.
  • the invention further relates to a device in the form of a name resolution server.
  • name resolution servers are frequently used, for example in the Internet area.
  • the function ⁇ oncan such servers also known as name servers or name resolution server, for example, cited in the earlier, "published on the Internet Preliminary lecture notes Lecture notes Distributed Systems / Ubiquitous computing in the summer semester 2003, Prof. Dr. med. Claudia Linnhoff-Popien "(www.nm.informatik.uni- muenchen. De / lectures / ss03 / vs_skript / discarde_systeme .pdf) described.
  • the known name resolution servers are characterized in particular by the fact that they try each ⁇ named assign a unique destination address, which requires that each successful request contain a name that allows a unique and well-defined resolution to a destination address.
  • the object of the invention is to specify a particularly efficient name resolution server.
  • a name ⁇ sauflies server to resolve a name to a destination address or destination addresses with a request- receiving means for receiving a a certain names containing the first request message from an application, wherein the under certain name from a under certain part name or consists of several partial names, one of which is under-determined at least, one associated with the inquiry reception device name resolution device for resolving the Festge by a predetermined sequence ⁇ stored first part name into a first address lusterswei ⁇ se in a plurality of first addresses a connected to the name resolution means response transmitting means for transmitting the determined from the predetermined order according ⁇ predetermined last partial name destination address or the so determined destination addresses or for sending the from the corresponding R predetermined order first specific name or first address determined in this way to the application, and one with the name Mensaufanss device connected to selecting means for selecting at least one of the first addresses and a transmission device for transmitting a remaining unresolved from the unnamed name of the subordinate name for further name
  • the name resolution server according to the invention is advantageous because its name resolution device also supports a resolution of certain sub-names. According to the explanations in connection with the present process, under certain possibly in interaction of several Na ⁇ mens resolution-Server, the resolution name is thereby made possible.
  • the use of a selection device and a transmission device is advantageous since, when using the recursive method according to the invention, it is possible to select a first address or a plurality of first addresses and, by means of the transmission device, to include a second request message containing a residual name for further name resolution on at least one second To send name resolution server.
  • the name resolution server according to the invention has a memory device for storage by the selector of unselected first addresses.
  • a name resolution server with a memory device offers the advantage that initially not selected first addresses can be stored for possible later use.
  • the memory device is preferably a main memory with short access times.
  • the name resolution server can also be configured such that the name resolution server has an error message generation device for generating an error message message to be transmitted to the application by the response transmission device in the event of failure of the resolution of the underdetermined name, the name resolution device for Triggering the error message message is connected to the error message generating means and the error message generating means is connected to the response transmitting means for sending the error message message to the application.
  • the name resolution device for Triggering the error message message is connected to the error message generating means and the error message generating means is connected to the response transmitting means for sending the error message message to the application.
  • This embodiment is preferred because a corresponding feedback to the application can be given by means of the error message generating means in case of failure of the name resolution.
  • the name resolution server has a response receiving device for receiving the destination address or destination addresses or an error message message from the second name resolution server.
  • the error message receiving facility advantageously allows the response to the failure of further name resolution by a second name resolution server or another downstream name resolution server.
  • the hierarchy of name resolution servers participating in the name resolution is based on the hierarchy of the subnames, ie. H. from the predetermined order of resolution of the individual part names, results. An absolute, in any case valid hierarchy of the various name resolution servers does not exist.
  • the name resolution server is designed so that the response receiving device with the Selection device is connected, so that after receipt of the error message message for the selector at least one more of the first address is selectable and the underdetermined name for name resolution by at least one further second name resolution server to the at least one selected first address can be sent.
  • the first addresses can be used sequentially as a starting point for further name resolution.
  • FIG. 1 shows a flow chart of the steps taking place on the first name resolution server in a preferred embodiment of the recursive method according to the invention
  • Figure 4 is a schematic representation of an embodiment of the name resolution server according to the invention.
  • FIG. 1 illustrates, with reference to a flow chart, the steps that are executed on the first name resolution server in the context of the method according to the invention. It should be pointed out sen that the running on other possibly participating in the name resolution ⁇ solution name resolution servers are analogous steps, ie the difference essentially consists only of where the request message is received and where ⁇ accordingly a response message or Starbucksel ⁇ message message is sent. Furthermore, in the case of the various name resolution servers, the part names and the addresses selected in the request message usually also differ.
  • the method sequence shown in FIG. 1 corresponds to an advantageous embodiment of the recursive method according to the invention.
  • a first name resolution server in a first request message from an application receives an underdetermined name consisting of multiple partial names, at least one of which is underdetermined.
  • the first partial name is resolved by the first name resolution server into a first address or a plurality of first addresses.
  • step 110 Has been If the check in step 110 that the first part ⁇ names keeping the whole under certain name completeness, ⁇ dig resolved (since the under certain name consists of only a certain part name), as is or are in step 111, the determined first address or ermit ⁇ telten first address as the destination address or destination addresses sent back to the application. According to step 112, the method is thus successfully completed.
  • step 115 it is possible, according to step 115, to store the first address or the first addresses in a memory device.
  • process flow representing the method according to the invention in a ⁇ Sonders be clear format, it is checked in step 120 whether at least a first address in the spoke pure ⁇ direction is present. If this is not the case, then in step 121 an error message to the Ap plication ⁇ is sent back, and in accordance with step 122 is completed, the process unsuccessful.
  • At least one first address is present in the memory device, at least one first address is selected and the selected first address or the selected first address is deleted from the memory device.
  • the goal here is to avoid using the same first addresses several times. This can alternatively be prevented by marking already used first addresses.
  • the first address or the first addresses can be stored in the memory device only after the selection of the first address or the first addresses, ie. H. In this case, only the non-selected first addresses are stored directly in the memory device.
  • a residual name from the unresolved partial name of the underdetermined name is sent to the at least one selected first address for further resolution by at least one second name resolution server in a second request message.
  • Entspre ⁇ accordingly the method according to the invention of the first address assigned second name resolution server now tries to first part name of the rest name.
  • the first address can directly define the connection path to the second name resolution server, or the connection path to another resource, which then forwards the second request message to its assigned second name resolution server.
  • the recursive method usually involves further name resolution servers. This is done such that the second Na- mens resolution server least sends a second request message to Minim ⁇ a second address.
  • the first name resolution server would return the result of the resolution of the first partial name to the application, which in turn enables it to send a new request to the first one transmitted by the first name resolution server Address or the transmitted first addresses.
  • the first name resolution server receives a response from the second name resolution server assigned to the first address.
  • the second Namensauflö ⁇ sung server itself, or an additional, subordinate name resolution server to certain names, that is the last part of the name of the certain name in a target address or to multiple destination addresses dissolve, the answer includes a target Address or multiple destination addresses.
  • the method according to the invention in step 140 is completed successfully, the determined destination address, or it ⁇ mediated destination addresses are sent from the first Namensauflö- sung server in response to the request message to the Ap ⁇ plication.
  • the sending of the destination address or destination addresses to the application can also be made directly from the name resolution server, which resolves according to the predetermined order last partial name. In this case, however, it must be ensured that, for example, the memory occupied by the first name resolution server with the unselected first addresses is released again. This can be done by sending an appropriate message to the first name resolution server or by a timed automatic release.
  • the first name resolution server receives an error message message in response to step 135.
  • the first name ⁇ saufliess server reads out one or more further first addresses from the storage means and sends the rest of the name to this, after which a further second Name Resolution Server attempts to resolve the underdetermined remainder name.
  • Figure 2 shows for further clarification of the process of the invention and its potential applications in a sketch based on an embodiment, the run of the inventive recursive process between the involved different during the ex ⁇ components, ie essentially the participating name resolution servers, exchanged messages.
  • the car driver is a member of the German Automobile Association (ADAC) and also knows that the ADAC has partners in Tru for its members' roadside assistance. This means that the car driver knows that he wants to contact a car mechanic who is in charge of a car Partner of the ADAC affiliate in Poland works and is close to the current location of the car driver and his vehicle.
  • ADAC German Automobile Association
  • M2M Machine-machine
  • the vehicle of the car ⁇ driver's is equipped with a sensor network that already found the defect of the vehicle before it comes to the actual breakdown
  • the sensor network may determine based on the available information that to solve the problem or defect contacting a ei ⁇ ner local auto repair is required or such a workshop must be visited.
  • the sensor network is in a similar situation as the car driver, ie it must locate and contact one or more local repair shops for the corresponding vehicle type.
  • each defined ⁇ the part a new name space under consideration of the namespace of the parent part of the name, that is, the part name (m) only makes sense if the part name (m-1) could be resolved .
  • a sub-name specifies all conditions which have to fulfill the resources identified by the corresponding addresses.
  • a part name ren a specific resource or a list of resources iden ⁇ or some simple, logical operations Shortcut ⁇ te conditions include. This makes it possible to name communication partners (or intermediate name resolution servers) by specifying their attributes, ie their properties.
  • the motorist names the car mechanic with whom he would like to speak with the following name: "(a freelance mechanic) @ (a branch near the place) @ (a partner in Poland) @ (ADAC in Germany)"
  • the motorist has the option to specify that he wishes, for example, exactly one destination address in response to his request.
  • the driver can the underdetermined name z. B. by clicking together the corresponding part names from an ADAC website, by clicking on words of a standardized language, which is offered to him by his mobile communication terminal 15 or create using a free speech, in the latter case, the words or sentences entered through an intelligent process must be mapped to the standardized language or part names, so that they can be understood and resolved by a name resolution server according to the invention.
  • the driver (or an application) now sends a request message to a first name resolution server 20 by means of the mobile communication terminal 15 (which is shortened in the figure abbreviated abb ⁇ terminal)
  • the address of this first name resolution server 20 is preferably in the mobile communication terminal 15 configured, wherein the configuration can be either static or dynamic.
  • the first name resolution server 20 may also be location-dependent, ie dynamically configured or specified.
  • the configuration of the first name resolution server 20 to be used does not have to be done in the mobile communication terminal 15 itself.
  • the selection of the first name resolution server can be carried out by the mobile radio network, that is, in the described embodiment, for example by the local polni ⁇ cal mobile network.
  • the mobile network can o- of the mobile communication terminal 15 make the selection of the ten ers ⁇ name resolution server 20 already in response to the first part of the name of the name.
  • the first request message 1 which contains the name "(a freelance mechanic) @ (a branch near the place) @ (a partner in Poland) @ (ADAC in Germany)", is used in the embodiment of FIG the mobile communication terminal 15 of the motorist due ei ⁇ ner corresponding configuration to a in Germany lo- scaled first name resolution server 20 sent.
  • This first name resolution server 20 determines from the first part called "ADAC in Germany” as the first address, the address of the assigned ADAC name resolution server 25. This means that the first name resolution server is 20 exactly ei ⁇ ne first address.
  • the remainder of the unresolved partial names of the subdestined name "(a freelance mechanic) @ (a branch near the location) @ (a partner in Poland)" in a second request message 2 is sent to the first name resolution server 20 from the first atten ⁇ men determined first address, that is the name resolution server of the ADAC 25 again, this attempt the first part of the name of it receives residual name, "(a partner in Poland)" resolve that and finds two corresponding second addresses, allocated to the Aid 1 in Poland and Aid 2 in Tru facilities.
  • the ⁇ -making process according to the not yet operating OF INVENTION strictly sequentially, and therefore which is stored associated second address for a possible future use in a memory device of the name resolution server, the ADAC 25 of the device "Help 2 in Poland.”
  • Dissolved residual name second Stage "(a freelance mechanic) @ (a branch near the location)” sends the name resolution server of the ADAC 25 in a third request message 3 to the determined second Ad ⁇ resse of "Help 1 in Poland" second stage "the name consisting of the remainder name (which could also be referred to as remainder name of the first stage) less its first part name, ie generally the name sent to a second address.
  • the Terms "3rd level residual name", "4th level residual name” etc. are defined.
  • the name resolution server 30 associated with "Help 1 in Poland” can not resolve the partial name "(a branch near the location)" of the received second-level residual name, and therefore sends an error message message 4 back to the name resolution server of the ADAC 25.
  • the name resolution server of the ADAC 25 selects from the memory device the second second address "Help 2 in Poland" which it has determined, and in a further third request message 5 sends the remainder name of second level "(a free auto mechanic) @ (a branch in the Near the place) "to this address.
  • the name resolution server 35 assigned to "Help 2 in Poland” succeeds in resolving the partial name "(a branch near the location)". He finds two corresponding third addresses - "branch 1 near vehicle” and “branch ⁇ place 2 near vehicle”. Again, the "branch 2 near vehicle” assigned third address for possible later use in a memory device of the "Help 2 in Poland" associated name resolution server 35 is stored.
  • the mobile communication terminal 15 In order to be able to resolve the partial name "(a branch in the vicinity of the location"), it is necessary for the current name of the mobile communication terminal 15 to be contained in the partial name.
  • This information can be provided both by the mobile communication terminal itself (for example on the basis of a posi ⁇ tion determination by means of a built-in GPS (Global Positioning System) receiver or by the mobile radio network, in which is the mobile communication terminal is booked, are provided.
  • GPS Global Positioning System
  • the unresolved third-name remainder name "(a freelance auto mechanic)" containing only a single subname is proximate from the name resolution server 35 associated with "Help 2 in Poland" in a fourth request message 6 to "branch 1 "sent."
  • vehicle branch 1 near the vehicle "organized by their Na ⁇ mens resolution-server 40 (which also can only be a simple server without real name resolution functionality functionally gegebe ⁇ applicable,) all their Autome ⁇ mechanic centrally and provides means of a Database query that currently no auto mechanic is available. Accordingly, "Branch 1 near vehicle” sends an error message message 7 back to name resolution server 35 of "Help 2 in Poland".
  • the name resolution server 35 of "Help 2 in Poland” sends the remainder name of third level in another fourth request message 8 to the other third address of "Branch 2 near vehicle”.
  • "Branch 2 near vehicle” manages its mechanics decentralized by means of its assigned name resolution server 45 and therefore sends a fifth request message 9 to the terminal 50 of a first au ⁇ tomechanikers.With the fifth request message 9 is not a request for name resolution according to the previous request messages, but rather a request. Since the first mechanic is busy with another application, he leans means is ⁇ nes terminal 50, the fifth request message 9 and sends an error message 10 back to the Namensauflö ⁇ sung server 45 of "Branch 2 near vehicle".
  • the terminal may have been configured by the first mechanic basis of which the insert 50 that it is the fifth request message 9 automatically dung object 10 will respond with the error indication ⁇ .
  • the name resolution server 45 of "near branch 2- ⁇ imaging" now sends a further fifth request message 11 (corresponding to a further request) to the terminal 55 of a second car mechanic. This is free, that is the call for help for adoption. So ⁇ With the entire underdetermined name could be resolved, ie it could be determined a destination address.
  • the terminal 55 of the second mechanic now sends a He successfully message ⁇ 12 persons involved in all of the name resolution in the successful path name resolution servers 20, 25, 35 and 45, so delete all addresses stored in the storage devices and all other for Processing of the request reserved resources can free again.
  • this step it is not mandatory for the novel process ⁇ conducive.
  • the corresponding resources including those relating to the storage of the addresses in the storage device, could be released again from the requesting name resolution server immediately after sending a request to another name resolution server, or the release could be done automatically after a certain time .
  • the determined destination address is not sent directly but via the name resolution servers 45, 35, 25 and 20 participating in the name resolution to the mobile communication terminal 15. In this case, it is also possible, preferably on the basis of the corresponding message a release of in the name resolution servers 45, 35, 25 and 20 for the processing of the respective request message 8, 5, 2 or 1 occupied resources are triggered.
  • the terminal 55 of the second au ⁇ tomechaniker can now send its address, ie the sought for a routing, ⁇ sought, target address, by means of a message 13 to the mobile communication terminal 15 of the driver or directly try to a communication connection to build the mobile communication terminal 15.
  • FIG. 3 shows in a sketch a further exemplary embodiment of the method according to the invention.
  • an employee of a project "ABC” tries to connect his PC 195 with a videoconference between the partners involved in the project "ABC”.
  • the project staff finds that he accidentally deleted the email with the exact video conference data.
  • the project staff is aware that the name of the videoconference is always "ABC” and the video server is either from the company X or from the company Y.
  • the project team member can make the videoconference with the he wants to connect with the following name: "ABC @ (a videoconferencing server) @ (Company X or Company Y) ⁇ .com”.
  • the project staff (or the PC 195 or running on the PC 195 software application) sends a first to ask ⁇ message to a first name resolution server 200 (in the Internet area also known as root servers).
  • the first name resolution server 200 solves the first part name ".com" in a first address and sends a second message to ask ⁇ with the rest of the name of this first address.
  • first address assigned name resolution server 205 solves the part name "(company X or company Y)" in the two ⁇ th addresses of the X and Y company and transmits according to a preferred embodiment of the method according to the invention simultaneously third request messages with the rest ⁇ name second stage "ABC @ (a videoconferencing server)" to the second addresses of the companies X and Y.
  • the name resolution server of the company X 210 and the company Y 215 solve the Generalna ⁇ men "(a videoconferencing server)" in third addresses of two videoconferencing servers 211 and 212 and of a videoconferencing server 216 and send to these third addresses in fourth request messages the third-level remaining name from the last subname "ABC".
  • the name resolution server of the company X 210 and the company Y 215 directly try to resolve the last partial name, and establish a connection of the project staff's PC 195 to the corresponding videoconferencing server.
  • the video conference will take place of the "ABC" -Pro jektes on the second video conference server 212 of company X instead. Accordingly, this server sends a po ⁇ sitive confirmation back either directly to the PC 195 of the project member or through the intermediary of participating name resolution servers 210, 205 and 200.
  • the project staff's PC 195 can now connect to the videoconferencing server 212 on which the videoconference of the "ABC" project is taking place, and answer the two videoconferencing servers 211 and 216 on which the conference is not taking place the fourth request message, however, each with a corresponding error message message.
  • Figure 4 shows a schematic representation of an embodiment of the name resolution server 309.
  • a requesting application 300 and a second name resolution server are shown ⁇ 320th
  • the application 300 is connected to a request receiving device 310 of the name resolution server 309 according to the invention.
  • the terms "connected” or “compound” in the present application generally refer to an electrical connection. Due to the electrical connection, the Request receiving means 310 receive a certain name containing first request message from the application 300, the under certain name from a specific part under ⁇ name or consists of several partial names, one of which is at least under determined.
  • the request receiving means 310 is connected to a name resolution means 311 which serves to resolve the first partial name fixed by a predetermined order into a first address.
  • the name resolver 311 is further connected to a selector 312 for selecting at least one of the first addresses.
  • the selection device 312 is connected to a transmission device 313 for transmitting a remainder name consisting of the as yet unresolved part names of the subdestined name.
  • the object of the transmission device is a name the rest-containing second request ⁇ message to at least a selected first address to send.
  • the first address is or the first addresses are directly or indirectly (ie, with internal interposition example of another server) associated with the second name resolution server 320.
  • a entspre ⁇ sponding second request message is then required, Lich generally ⁇ when the under certain name from a plurality of partial name is and thus can not be completely dissolved already by the name resolution server 309th
  • the name resolution server 309 has a response transmitting device 314 connected to the name resolution device 311.
  • the answer can be on the one hand from the corresponding from the pre ⁇ certain order specified last partial name specific destination address or the destination addresses determined so. This is approximately the case when the Namensauf ⁇ solution-Server 309 could completely resolve the certain name or method of the invention a plurality of name resolution servers 309 and 320 to the name resolution so expires also in the participation that the response ⁇ plication to the Ap 300 is always sent via the name resolution server 309, which has received the original request message from the application 300.
  • the answer may also consist of the first address determined from the first partial name determined in accordance with the predetermined sequence, or of the first addresses thus determined. This is the case if the name resolution runs iteratively. In this case, the name resolution server 309 always returns the result of the resolution of the first partial name regardless of whether the entire underdetermined name could already be resolved, to the application 300.
  • the name resolution server 309 furthermore has a memory device 315 in which non-selected first addresses can be stored by the selection device 312. These previously not yet selected first addresses can then be read out again from the memory device 315 by the selection device 312 at a later time and used for sending further second inquiry messages.
  • FIG 4309 further comprises the Invention ⁇ proper name resolution server an error message generating means 316th With this error message messages can be generated, for example, if the name resolution failed.
  • the corresponding error message messages are generated by the name resolution device 311 in the error message generation device 316 and transmitted via a connection to the response transmission device 314 and from there to the application 300.
  • Response receiving means 318 allows name resolution server 309 to receive positive (ie, containing one or more destination address (s)) or negative response messages (ie, error message messages) from second name resolution server 320.
  • the response receiving device 318 is required only in the application of the recursive method according to the invention. In the application of the iterative process of the invention for name resolution can as well as the transmission device 313 omitted, since in this method there is no communication of the name resolution server 309 to the second Namensauflö ⁇ sung server takes place 320th
  • the response receiving means 318 is connected to the name resolution means 311.
  • connection between the response receiving device 318 and the selection device 312 is only indirectly, ie. H. via the name resolver 311.
  • a direct connection of the response receiving device 318 to the selection device 312 is possible within the scope of the invention.
  • not all connections between the components of the name resolution server 309 are shown in the sketchy representation of FIG. 4, but only those actually required for explaining the functionality of the name resolution server according to the invention.

Landscapes

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

Abstract

L'invention vise à mettre en oeuvre un procédé efficace de résolution de nom. Dans un premier serveur de résolution de nom a) un nom indéterminé, composé de noms partiels indéterminés ou de plusieurs noms partiels, est reçu dans une requête d'une application; b) le premier nom partiel défini selon une première séquence dans une ou plusieurs premières adresse est résolu ; c1) la première requête est traitée par émission de la première adresse en tant qu'adresse cible à l'application si le nom indéterminé est résolu complètement ; c2) dans le cas contraire, la première adresse est choisie et un nom résiduel composé des noms partiels non résolus du nom indéterminé est émis pour la résolution ultérieure par l'intermédiaire d'au moins un autre serveur, dans une deuxième requête, au moins à la première adresse sélectionnée ; et, d2) des étapes correspondant aux étapes a, b et c2 sont répétées avec le nom résiduel formé jusqu'à ce que le procédé récurrent traite dans une étape correspondant à l'étape c1), la première requête, par émission de l'adresse cible définie en fonction de la séquence donnée, à l'application. L'invention concerne également un procédé itératif et un serveur de résolution de nom.
PCT/EP2006/062769 2005-06-21 2006-05-31 Procede de resolution de nom et serveur correspondant WO2006136487A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102005029661.0 2005-06-21
DE102005029661A DE102005029661B3 (de) 2005-06-21 2005-06-21 Verfahren zur Namensauflösung und Namensauflösungs-Server

Publications (1)

Publication Number Publication Date
WO2006136487A1 true WO2006136487A1 (fr) 2006-12-28

Family

ID=36956109

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2006/062769 WO2006136487A1 (fr) 2005-06-21 2006-05-31 Procede de resolution de nom et serveur correspondant

Country Status (2)

Country Link
DE (1) DE102005029661B3 (fr)
WO (1) WO2006136487A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110320524A1 (en) * 2010-06-29 2011-12-29 Alcatel-Lucent Usa Inc. Technique For Effectively Reducing Latency Of Locating A Resource On A Network

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001039431A2 (fr) * 1999-11-26 2001-05-31 Neteka Inc. Serveur d'adresses reseau
EP1303109A2 (fr) * 2001-10-16 2003-04-16 Microsoft Corporation Résolution de noms virtuels de réseau
US6594254B1 (en) * 1996-08-16 2003-07-15 Netspeak Corporation Domain name server architecture for translating telephone number domain names into network protocol addresses

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001029001A2 (fr) * 1999-10-15 2001-04-26 Nametree, Inc. Recherche du nom de domaine
KR100856149B1 (ko) * 1999-11-26 2008-09-03 네테카 인코포레이티드 전자 메일 서버 및 전자 메일 통신을 용이하게 하기 위한 방법
GB2413742B (en) * 2003-11-05 2006-05-31 Internet Comp Bureau Plc Computer address resolution
US7305252B2 (en) * 2003-12-09 2007-12-04 Nokia Corporation System and method for service naming and related directory structure in a mobile data network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6594254B1 (en) * 1996-08-16 2003-07-15 Netspeak Corporation Domain name server architecture for translating telephone number domain names into network protocol addresses
WO2001039431A2 (fr) * 1999-11-26 2001-05-31 Neteka Inc. Serveur d'adresses reseau
EP1303109A2 (fr) * 2001-10-16 2003-04-16 Microsoft Corporation Résolution de noms virtuels de réseau

Also Published As

Publication number Publication date
DE102005029661B3 (de) 2006-11-30

Similar Documents

Publication Publication Date Title
DE60124440T2 (de) Namensverwaltungskonvention für verschiedene Gerätetypen, und Vorrichtung und Verfahren zur Anwendung dieser Namensverwaltungskonvention
DE102008030974B4 (de) Verfahren zum Bereitstellen von datenbezogenen Diensten für ein Fahrzeug mit Telematikausstattung
DE102007051157A1 (de) Verfahren zum Herstellen einer Datenverbindung zu einem Fahrzeug mit Telematikausstattung
EP1320974B1 (fr) Repertoire electronique a utiliser dans un systeme de communication
EP2324619B1 (fr) Procédé de transmission et de traitement de données de fonction commandées par réseau entre un client et un serveur
DE602005005814T2 (de) Vorrichtung und Verfahren zur Fernaktivierung/-deaktivierung von Diensten für Kommunikationsendgeräte über ein IP Netzwerk
DE10208295A1 (de) Verfahren zum Betrieb eines Sprach-Dialogsystems
EP1362304A2 (fr) Systeme et procede pour generer et memoriser des pages web tout en optimisant l'encombrement en memoire
EP1280081A1 (fr) Méthode, réseau de communications, ordinateur de service et module informatique pour fournir un service d'organisation de rencontres entre participants d'un réseau de communications
WO2001020450A2 (fr) Systeme et procede pour assister l'interaction de groupes (gia) dans des espaces d'information hypermedia
DE102005029661B3 (de) Verfahren zur Namensauflösung und Namensauflösungs-Server
EP1312233B1 (fr) Terminal, reseau de telecommunication et procede pour entrer un numero d'appel dans une memoire de numeros d'appels
EP2198590B1 (fr) Sélection paramétrisable d'un système de communication au moyen de mécanismes de résolution basée sur des noms
DE10146518A1 (de) Verfahren zum Verbinden von zwei Endgeräten über ein Informationsnetz, sowie Endgeräte und Server zur Durchführung des Verfahrens
DE102007053916A1 (de) Verfahren zum Verwalten von Netzkomponenten in einem Netzwerk und Netzkomponente
EP2933985B1 (fr) Utilisation de multidiffusion DNS
EP1843539B1 (fr) Vérification automatique de données de contact de messager
DE10019727A1 (de) Netzwerkserver
EP1518386B1 (fr) Systeme et procede de communication directe entre des appareils d'automatisation
DE60104672T2 (de) System zur überwachung von terminals
EP2036281B1 (fr) Procédé d'enregistrement automatisé d'adresses dans une liste d'émetteurs acceptés dans un système de communication
DE102021123074B3 (de) Vermittlungsvorrichtung zur Vermittlung eines Fahrzeugflottenservers zur Aktivierung einer Fahrzeugfunktion und Verfahren
DE102005046457B4 (de) Verfahren zur Übertragung einer elektronischen Nachricht über mindestens ein Kommunikationsnetz
EP1302751A2 (fr) Procédé et dispositif pour sélectionner une destination dans un système de navigation véhiculaire utilisant un centre serveur
WO2003096652A2 (fr) Procede d'adressage

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase

Ref country code: DE

WWW Wipo information: withdrawn in national office

Country of ref document: DE

122 Ep: pct application non-entry in european phase

Ref document number: 06777248

Country of ref document: EP

Kind code of ref document: A1