WO2003090406A1 - Method and device for finding a network element having a determined functionality on an established route in a data or communication network - Google Patents
Method and device for finding a network element having a determined functionality on an established route in a data or communication network Download PDFInfo
- Publication number
- WO2003090406A1 WO2003090406A1 PCT/DE2002/001458 DE0201458W WO03090406A1 WO 2003090406 A1 WO2003090406 A1 WO 2003090406A1 DE 0201458 W DE0201458 W DE 0201458W WO 03090406 A1 WO03090406 A1 WO 03090406A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- function
- network
- station
- stations
- connection
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 18
- 238000004891 communication Methods 0.000 title description 3
- 230000006870 function Effects 0.000 claims description 99
- 230000011664 signaling Effects 0.000 abstract description 7
- 238000012790 confirmation Methods 0.000 description 12
- 230000005540 biological transmission Effects 0.000 description 2
- 230000001419 dependent effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
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/14—Session management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/26—Route discovery packet
-
- 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/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
- H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
- H04L69/329—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the application layer [OSI layer 7]
Definitions
- the invention relates to a method for finding out an element in a network with the preamble features of claim 1 and devices for performing such a method.
- Communication and data networks consist of a large number of devices that are connected to each other via interfaces.
- data is routed via a path which may be set up via a large number of intermediate stations.
- a route or route To set up such a path, also referred to as a route or route, from a first to a last station in such a network, the path from the first to the last station is initially requested with signaling information that contains the connection establishment request.
- the path as such can be determined by controlling higher-level elements, but can also be done by an automatic search of
- Station to station based on the signaling information.
- At least one of the stations can perform one or more specific functions.
- the object of the invention is to propose a method for finding out a specific network element with a specific functionality on a defined or to be determined path. This object is achieved by a method for finding out a network element in a network with the features of patent claim 1 or a network element or a network station for carrying out such a method and with device features of patent claim 8.
- one of the stations or one of the network elements on the data connection path can carry out the specific function and send corresponding function information to the other stations in the connection sequence means that this station can be identified on the one hand and on the other hand marked for the execution of the function or be reserved.
- the first possible station that can perform such a function is reserved or reserved for this purpose, the first station being the last station on the path from the point of view of the station requesting the function execution. This enables the front part of the path to be disconnected and network resources to be released or relieved.
- the functional information can expediently be transmitted directly together with the connection request.
- the functional information is also intended to indicate the functional capability in order to specify the function.
- the devices for carrying out the method expediently have a function memory in which it can be noted for which of the stations possibly requesting the function the function is to be carried out. This is particularly useful if the function executing Station should receive this instruction only from either the first or the last station on the data path, while the execution of the function is to be carried out by another station if the function execution is requested by the other of these two stations.
- the provision of such a memory is particularly advantageous if the corresponding stations with the ability to perform the function also serve as a station of the data origin, station of the data destination or intermediate station for another data path from other independent stations.
- the functional execution can expediently be requested from either only the first or only the last station. However, it is advantageously not important for the function-requesting station to know which station is performing the function, but it is useful to know that any station on the path has the ability to perform the function.
- connection set-up permanently reserves stations for only this one connection, so that instructions or data from further data paths cannot run via these stations or parts of the data path.
- connection setup variable in such a case expediently containing path information for routing the data from station to station in a data header section.
- a variable connection setup is also advantageously possible, for example, if identification information is transmitted together with the data, it being then possible for the individual stations to be assigned a route on the basis of the identification information.
- the area of application relates to telecommunications networks, although transmission to other networks, in particular data networks, should not be excluded.
- FIG. 1 shows an arrangement of stations in a network, a first data path from a data-transmitting to an ultimately data-receiving station being identified by arrows,
- Fig. 2 is a table showing an exemplary memory structure in such stations and
- FIG. 3 shows a table for displaying functional information.
- a network for example a telecommunications network or data network, consists of a plurality of individual stations TO, T1-T10, TE, which are interconnected by interfaces V1-V13.
- the interfaces can lead from one of the stations TO, TE, T1-T10 to only one adjacent station or to several neighboring stations TO, TE, T1-T10.
- the interfaces V1-V13 are designed as radio interfaces and / or line / wire-bound interfaces.
- the individual stations expediently each have a processing device for their operation and for data and information exchange via the corresponding interfaces V1-V13. If the individual stations TO, TE, T1-T4 are able to carry out certain functions F, they have corresponding hardware- or software-based modules. In particular, the stations show if the function can be carried out also corresponding memory areas in a memory that is provided for managing the functionality.
- the table in FIG. 2 represents a memory space which is prepared for the management of a station T2 with several functions.
- Information about the stations, data paths concerned and / or identification features of the corresponding data to be forwarded or to be routed can be stored in a first column of the table shown.
- the first line is the first
- the second column of the table indicates the type of functions Fx, Fy that can be requested. In the present case, only the function Fx can be requested from the station TO. Another function Fy is currently or generally not available from this station. In principle, however, it can be said that other conceivable functions are also possible which are not stored in the table and are therefore ignored by the last station TE when requested.
- the next, fourth line shows what station T2 should do with regard to its function Fx when an instruction from the last station TE is received via the exemplary data path.
- the function Fx has to be executed, the status is "Orig".
- a station T2 which is on a data path TO-TE or VI-V6, receives a request whether If it can perform a specific function Fx, Fy, it has various options to react to this request. In the event that it cannot carry out the function Fy, it can either transmit a negative or no message or function information “Fy-supported: no”.
- the transmission can be in the direction of the data path or data path to the end station TE of the Data path, but also in the direction of the requesting first station TO on the data path. In particular, it is possible to append or insert the response directly to the signaling information through which the request is transmitted.
- This function information is exemplified as "Fx- Supports: Yes / No "shown in Fig. 3. While it is possible to send negative or no information in the event that a specific function cannot be carried out, it is advisable to send corresponding information in the case of feasibility. This information can consist in simply inserting the value "yes".
- a connection is to be initiated or initiated by the network element or the station TO.
- the aim of the data connection should be the network element TE as the last station TE of the data path.
- the data path is to run from the first station TO via the intermediate stations T1, T2, T3, T4, T5 to the last station TE and the interfaces VI-V6 connecting these stations directly.
- the execution of a specific function Fx or functionality should be made possible.
- Stations which can carry out certain functionalities Fx, Fy are, in the present exemplary embodiment, the stations TO, T1-T4 and TE.
- a certain Function Fx must be executable, which is only possible in stations T2 and T3.
- Request function Fx it should be carried out by a station T2 located as close as possible to the station TO or ideally by the station TO itself.
- a connection is first established, all stations are in a state of inactivity on a predetermined data path from the first station TO to the last station TE, including these two stations TO, TE.
- the entry “idle” or “idle” is entered behind the function value Fx for all stations TO, TE, T1-T10.
- the first station TO of the sequence of stations TO, TE, T1-T5 sends one in a first step
- Signaling information which contains the connection establishment request, about the route or the data path to the last station TE.
- Table or the memory (FIG. 2) would be noted behind the entry for the function Fx, for example “Orig”. Furthermore, the first station TO would send the other stations T1-T5, TE the information that the function is already being carried out in the event of the function request from TE “Fx-supported: Yes”.
- no additional information can be sent if it is set up by subsequent network elements or stations T2, T3, for example, or the absence of additional information is interpreted accordingly by subsequent stations in such a way that the preceding stations TO, Tl are not on the way in the Are able to support the requested function Fx.
- Connection establishment request or the corresponding signaling information used or attached to it In principle, separate additional forwarding of this additional information is also possible.
- TE receives the connection setup request with the additional information "Fx-supported: Yes", then this later station T3-T5, TE retains the function Fx state even in the event of the possible function execution:
- the case is described below in which it is to be found out which station T3, T2 is to carry out the requested function Fx when this function is called up by the first station TO at a later point in time.
- the last station TE After receiving the connection establishment request described above, the last station TE sends a confirmation back to the first station TO.
- the following procedure is preferred.
- the last station TE In the event that the last station TE can already carry out the requested function Fx, the last station TE changes into the corresponding state function Fx: "Term” and sends additional information “Fx-supported: Yes” together with the confirmation in the direction the first station TO.
- the last station TE does not master the execution of the function Fx, it maintains its previous state with regard to the function Fx, in the present example the state "idle”, and sends an additional information "Fx-supported: together with the confirmation: No "from. Again, no additional information can alternatively be sent. If one of the following network elements or one of the following stations which does not support the execution of the function Fx receives the confirmation with the additional information "Fx-supported: No", it maintains its status with regard to the function Fx "inactive" and sends it Additional information continues unchanged with the confirmation.
- the first network element or the first station T3 which supports the execution of the function Fx, in the best case the first station TO, in the worst case the last station TE, changes after receipt of the confirmation with the additional information “Fx-supported: No” their internal state.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/DE2002/001458 WO2003090406A1 (en) | 2002-04-19 | 2002-04-19 | Method and device for finding a network element having a determined functionality on an established route in a data or communication network |
DE10296854T DE10296854D2 (en) | 2002-04-19 | 2002-04-19 | Method and device for finding out a network element with a certain functionality on a fixed route in a data or communication network |
AU2002315653A AU2002315653A1 (en) | 2002-04-19 | 2002-04-19 | Method and device for finding a network element having a determined functionality on an established route in a data or communication network |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/DE2002/001458 WO2003090406A1 (en) | 2002-04-19 | 2002-04-19 | Method and device for finding a network element having a determined functionality on an established route in a data or communication network |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2003090406A1 true WO2003090406A1 (en) | 2003-10-30 |
Family
ID=29224127
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/DE2002/001458 WO2003090406A1 (en) | 2002-04-19 | 2002-04-19 | Method and device for finding a network element having a determined functionality on an established route in a data or communication network |
Country Status (3)
Country | Link |
---|---|
AU (1) | AU2002315653A1 (en) |
DE (1) | DE10296854D2 (en) |
WO (1) | WO2003090406A1 (en) |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6269099B1 (en) * | 1998-07-01 | 2001-07-31 | 3Com Corporation | Protocol and method for peer network device discovery |
-
2002
- 2002-04-19 AU AU2002315653A patent/AU2002315653A1/en not_active Abandoned
- 2002-04-19 DE DE10296854T patent/DE10296854D2/en not_active Expired - Fee Related
- 2002-04-19 WO PCT/DE2002/001458 patent/WO2003090406A1/en not_active Application Discontinuation
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6269099B1 (en) * | 1998-07-01 | 2001-07-31 | 3Com Corporation | Protocol and method for peer network device discovery |
Also Published As
Publication number | Publication date |
---|---|
DE10296854D2 (en) | 2005-03-10 |
AU2002315653A1 (en) | 2003-11-03 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
DE102006058818B4 (en) | Apparatus and method for converting text messages | |
EP1566029B1 (en) | Gateway unit for connecting sub-networks, in particular in vehicles | |
DE60031566T2 (en) | SIGNALING PROCESSES AND APPARATUS IN A CELLULAR NETWORK | |
DE112016005390B4 (en) | VEHICLE-SIDE TRANSFER DEVICE, ELECTRONIC CONTROL DEVICE AND VEHICLE-SIDE NETWORK SYSTEM | |
DE3853022T2 (en) | Procedure for the propagation of network status messages. | |
DE69328841T2 (en) | Multiprocessor computer system | |
DE602005004334T2 (en) | Nms for processing multi-server events | |
DE60117109T2 (en) | Wireless communication device, wireless communication system for its use and communication method therefor | |
DE69427732T2 (en) | Data transmission method using a data stream | |
DE2943149A1 (en) | LOOP BUS PRIORITY CONTROL METHOD IN A LOOP BUS NETWORK SYSTEM | |
DE60305998T2 (en) | An apparatus, gateway, and method for loading information between aircraft on-board equipment and off-board charging equipment | |
DE112008001963B4 (en) | Distribution device, communication system and communication method | |
DE60028174T2 (en) | Data transmission method using Layer 2 signaling of the protocol identifier, radio terminal and radio gateway | |
DE112008002092T5 (en) | Vehicle communication system | |
EP3456033B1 (en) | Method for transferring a file between a control device of a motor vehicle and a server device outside the vehicle, control device, server device and motor vehicle | |
WO2003090406A1 (en) | Method and device for finding a network element having a determined functionality on an established route in a data or communication network | |
EP3525476B1 (en) | Method to determine the topology of a mobile communication site and corresponding mobile communication site | |
DE10126618B4 (en) | Method for exchanging status information via direct radio links between subscriber terminals | |
DE3788417T2 (en) | Data transmission control method. | |
EP1992127B1 (en) | Communication system, computer, and method for determining a communication protocol to be used in a communication system | |
DE19846913A1 (en) | Electronic control device e.g. for preparing print data for high performance printer has bus controller that can read data stored in transmitter module and transfer to receiver module | |
DE112009000087T5 (en) | Vehicle relay connection unit | |
DE69331310T2 (en) | Distribution of functions in the packet switching network | |
DE2846130C2 (en) | Telegraph private branch exchange | |
DE69835555T2 (en) | State information management method and system using this method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
REF | Corresponds to |
Ref document number: 10296854 Country of ref document: DE Date of ref document: 20050310 Kind code of ref document: P |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10296854 Country of ref document: DE |
|
122 | Ep: pct application non-entry in european phase | ||
NENP | Non-entry into the national phase |
Ref country code: JP |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: JP |