WO2001071528A2 - Method for automatically allocating a network planning process to at least one computer - Google Patents
Method for automatically allocating a network planning process to at least one computer Download PDFInfo
- Publication number
- WO2001071528A2 WO2001071528A2 PCT/DE2001/000794 DE0100794W WO0171528A2 WO 2001071528 A2 WO2001071528 A2 WO 2001071528A2 DE 0100794 W DE0100794 W DE 0100794W WO 0171528 A2 WO0171528 A2 WO 0171528A2
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- network
- sub
- processes
- networks
- emulation
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 127
- 230000008569 process Effects 0.000 title claims abstract description 50
- 238000011156 evaluation Methods 0.000 claims description 9
- 238000004891 communication Methods 0.000 claims description 5
- 230000000903 blocking effect Effects 0.000 claims description 3
- 238000012545 processing Methods 0.000 claims description 3
- 238000012986 modification Methods 0.000 abstract description 2
- 230000004048 modification Effects 0.000 abstract description 2
- 238000001514 detection method Methods 0.000 abstract 1
- 230000005540 biological transmission Effects 0.000 description 7
- 238000005516 engineering process Methods 0.000 description 7
- 238000005259 measurement Methods 0.000 description 6
- 230000015572 biosynthetic process Effects 0.000 description 4
- 238000013461 design Methods 0.000 description 4
- 238000005755 formation reaction Methods 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 230000010354 integration Effects 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 230000011664 signaling Effects 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 238000001994 activation Methods 0.000 description 1
- 230000004913 activation Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000000354 decomposition reaction Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012806 monitoring device Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000012552 review Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
- G06F9/5066—Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs
Definitions
- the topology is determined and the network nodes and links or network connections, including the virtual connections, are dimensioned.
- a so-called traffic matrix is used, taking into account the established quality standards. Since the system states of the network also change due to the constantly changing requirements, so that existing nodes are extracted again, new ones are added or links are changed, these are the known static tools which, for example, cannot take into account changes in the topology of the network or a changed traffic routing, no longer sufficient.
- Sub-tasks are assessed and evaluated so that an optimal and automatic task distribution can then take place.
- a check and monitoring of the network planning is, for example, in the case of so-called ATM networks (asynchronous Transfer mode), which are based on the PNNI standard (Private Network Node Interface).
- the PNNI protocol is suitable for private networks of any size due to its scalable traffic routing method. Since this technology is based on a quasi self-organizing process of the network and continues to be a complex task that is characterized by a high degree of dynamics, a (review of) network planning is necessary, whereby an assignment of planning subtasks to available computers is necessary ,
- ATM relates generally to a transmission method that is based on an asynchronous time division multiplex method.
- ATM technology provides a technology that can meet today's requirements - especially in telecommunications technology - such as the highest possible guaranteed bandwidth and the possibility of processing multiple services.
- ATM technology opens up the possibility of multiple, virtual transmission channels. The capacity of these channels can be freely adapted to the respective application.
- the network comprises several switching centers, which are called switches and through which the respective data are forwarded.
- the ATM switches activate a virtual connection from a source (sender of the information) to a sink (receiver of the information) as required.
- various services can be transmitted, for example a data stream with a constant bit rate (CBR, constant bit rate) or with a variable bit rate
- VBR variable bit rate
- the PNNI protocol includes a signaling and routing protocol that has been designed to be applicable to a worldwide network.
- the PNNI routmg uses a source routmg to determine the path through a network. Each node therefore needs a description of the topology of the network in order to be able to carry out the necessary calculations and activations. The distribution of this information must therefore be guaranteed by the routing protocol. A continuous exchange of information between network information ensures that the network is recognized independently
- the PNNI protocol provides a three-level data structure for the topology information (IG - Information Group; PTSEs - PNNI Topology State Elements; PTSP - PNNI Topology State Packet).
- the information is distributed by flooding.
- the PNNI routing protocol is based on dynamic routing and is designed for several hierarchy levels and supports specified quality standards. Therefore, the PNNI protocol is far more complex than others. For all this reason, the design and planning aspect is important for ATM networks on which the PNNI protocol runs.
- the ATM switches represent a limitation for the system in that they have to be able to process the data quantities for a respective terminal in order to be able to operate it at the appropriate transmission speed. This aspect also makes it necessary to plan such a network precisely and, in particular, to investigate dynamically, as error-free as possible, which amounts of data, for example, can be processed by the respective ATM switches.
- Such a network planning tool has been published as a so-called PNNI emulator (cf. U. Grem elmaier, M.
- the object of the present invention is therefore a
- a method for assigning a network planning process which comprises the following steps: a) acquisition of specific evaluation parameters for the evaluation of the available performance and utilization of the entities involved in the method, b) determination of sub-processes, c) structuring of the sub-processes with regard to their priority and scope, d) manual and / or automatic assignment of the sub-processes to the entity (s), based on the recording of the evaluation parameters and on the determination and / or structuring of the sub-processes.
- Another object of the present invention is to create a platform for such a monitoring method, which takes into account the dynamic changes in the network over time and which can be carried out with normally designed computer power - that is to say without a high-performance system.
- the method is designed as a division method from a comprehensive network planning task to a freely selectable number of arbitrarily configured computers.
- quasi-self-organizing networks have to monitor and, if necessary, optimize the network and topology planning.
- the main task to disassemble various subtasks in such a way that these subtasks can be distributed to the computers and executed there.
- the task was to create a way that the complex planning task can be broken down and assigned in such a way that when emulating the network, real nodes as well as real nodes can be integrated.
- the method according to the invention is preferably designed as a hybrid method, so that it includes the integration of real nodes and / or virtual nodes in the
- Measured variables can include: the speed of the
- Another particularly preferred embodiment contains a graphical surface, which can optionally be activated in the emulation process, but which is not a mandatory prerequisite for its execution, since it would possibly also consume important computing power that would then be withdrawn from the emulation process.
- the control can alternatively also be carried out on a separate computer.
- An embodiment of the present invention which proves to be very advantageous in practice relates to the assignment of a network planning task to a PNNI network.
- the PNNI networks are organized hierarchically, so that the physical layer has a higher hierarchical structure, the nodes are grouped together and the information is now exchanged virtually.
- a very advantageous embodiment of the present invention includes the possibility of being able to run the emulation in a distributed manner, by integrating several hosts that host PNNI nodes. This has the advantage that the complete process load does not have to be carried by a single computer, as was previously the case, which was often overloaded according to the prior art.
- FIG. 1 shows a representation of a hierarchically lowest level of a network based on PNNI
- FIG. 2 shows a representation of three hierarchical levels of the basic structure of a network from FIG. 1
- FIG. 3 shows an overview of essential sub-processes in a network planning task
- FIG. 4 shows an overview of a
- FIG. 5 shows an overview of the architecture of a message control of the advantageous embodiment according to FIG. 4 and its integration into the main process
- FIG. 6 shows an overview of a node process of the advantageous embodiment according to FIG. 4,
- Main memory size and the like - can distinguish and which need not be special high-performance computers.
- the following evaluation parameters 54 are recorded: operating system (type and version), main memory (size and current load), swap area (size and current load), LAN access (maximum and current throughput) and LAN segments (medium Runtime between the individual computers, maximum and current throughput), current CPU utilization and the long-term utilization of the above parameters.
- Assessment parameters 54 will be weighted with regard to the takeover of respective sub-processes in order to increase the efficiency of the assignment process.
- the method according to the invention there is the advantage that, in the case of a CPU-intensive, complex task, even utilization of limited resources is achieved and information technology "bottlenecks" are avoided. Furthermore, the communication and coordination effort between the individual computers is significantly reduced.
- the complex process 10 serves as input for a planning file 22, on the basis of whose content the sub-processes b are recorded and their structuring c takes place.
- the sub-processes are advantageously decoupled from the other sub-processes as far as possible.
- the data relevant for the process 10, in particular data about the performance of the available computers 46 are stored in a configuration file 20.
- step A This performance is analyzed and evaluated in step A.
- steps B and C the data in the planning file 22 are processed, so that a capacity-oriented decomposition of the main press takes place in various processing processes.
- steps A, B and C based on the thereby worked out Data in step D assigned the sub-processes to the computers. Then the optimally distributed overall process 10 can run on the computers.
- the main process is an emulation process of a network, which is essentially subdivided into the following sub-processes: an emulation controller 12, a message distributor 14, a graphical user interface 16 and node processes 18.
- the network here is a PNNI network, the basic structure of which is shown in FIG. 1 and the group formation (for single and multi peer groups) in FIG. 2.
- 1 shows the physical networking with physical links 62 which are in data exchange with one another via switches 64.
- the terminal computers 66 can thus communicate with one another.
- FIG. 2 shows the different hierarchical levels (here 3) in an ATM network which is based on PNNI routing, with the lowest physical level, which is illustrated in FIG. 1, and with the virtual levels, which the logical group nodes 60 one represented peer group 58 and the virtual links 56.
- the controller 12 controls the distribution of the node processes 18 via the message distributor 14 to the computers / hosts 46 involved.
- the control of the emulation 12 is located centrally on a computer. During emulation 10, it transmits a planning file 22 to individual nodes 24.
- Configuration file 20 includes the data essential for emulation 10 in the form of a script language. It contains topology and configuration data, connection incentive patterns and error scenarios, such as node and / or link failures, which are stored in the file 22 with a time stamp and are then forwarded in a time-controlled and selective manner to the night distributors 14.
- selectively means that the controller 12 only forwards the messages to the message distributors 14 which are relevant to them in order to save computing power.
- the file 22 also contains the control of logging and trace formations that occur in the emulation 10.
- the controller 12 is responsible for coordinating the entire emulation 10. It also stants the node processes 18, carries out their configuration and is used for error emulation.
- the night distributor 14 is represented once on each computer which participates in the emulation 10. All message distributors 14 are integrated in an interprocess communication via TCP connections. The socket interfaces 38 m in connection with the message distributor 14 emulate both the physical links and the ATM links. Furthermore, the night distributors 14 comprise a central call generator for each computer and a process which stores the message flow for later analysis of the measurement data obtained.
- the instantiation of the node processes 18 takes place at the instigation of the controller 12 by the message distributors 14.
- the message distributors 14 convey the messages to the local node processes 18 or to other workstations.
- the emulation method is additionally equipped with the graphic surface 16, which can optionally be used in an emulation run. It is used to enter new network topologies and to visualize and interactively influence an ongoing measurement. It is connected to the central controller 12.
- the distributed emulation method according to the invention can therefore preferably be applied to PNNI networks, since these already provide for grouping and structuring (in the sense of a hierarchy) due to their protocol.
- the assignment is therefore preferably selected such that it takes into account the peer groupings of the individual nodes in the distribution step d in order to be able to take into account the group formation or the connectivity of individual nodes.
- explicitly existing network clusters can be combined into a sub-process.
- the individual sub-processes are then advantageously assigned to them according to their weight, which results from the number of nodes and links contained, and taking into account the evaluation parameters 54 of the individual computers. However, if only a few computers are available as sub-processes, several sub-processes can also be assigned to one computer.
- the entire planning task or in general the entire main process can be mapped onto a single computer.
- the solution according to the invention provides that the performance of the Network connections between the participating computers with a higher weight, such as a powerful and fast LAN connection, must be taken into account.
- FIG. 5 shows the central control 12 of the process 10. Its interfaces are interfaces to the planning file 22, to the graphical surface 16 and to the message distributor 14.
- a script interpreter 40 converts those received via the interfaces, in particular those via the file interface 36 Information in a form that is available to the processes. Status messages from the emulation process 10 are transformed into the script language and forwarded to socket interfaces 38.
- a built-in message buffer 44 stores the information in the order of its arrival in the event of a large flood of messages until it is processed.
- Logging 25 takes place throughout the emulation. It ensures that the recorded flow of messages is stored in a file, a log file 26. For example, the type and content of the message, its time, the size and the addresses of the source and sink are noted in order to enable statistical analysis following the emulation.
- a configurable filter makes it possible to fill in information that is not relevant for the analysis. Further data measured by the method 10 and stored in the log file 26 relate to indirectly contained grouping information of nodes within the network, the current and long-term network utilization, blocking information (location and time of the call blocking).
- the node processes 18 contain the PNNI protocol.
- the software in this regard is specially designed for the method according to the invention in order to be able to ensure integration in the emulation environment.
- the operating system and the interfaces for emulation are adapted by the .Module System Services 28, which surrounds the node software like a shell.
- the module 28 communicates externally with the controller 12 and within the node 18 with a call control module 30, an AAL adapter 32 and a layer manager 34.
- the layer manager 34 is used to control and monitor the PNNI signaling 48, the Q.SAAL layer 52 and the PNNI routmgs 50.
- the AAL adapter 32 maps the transport of ATM messages between the nodes to the communication model of the emulation.
- the call control module 30 implements the connection incentives of the local message distributor 14 m call requests and routing requests to the protocol software and triggers the calls again at a later point in time.
- the planning file 22 shown in FIGS. 7 and 8 preferably contains data for the basic configuration for a respective node, such as the number of ports, number of possible links, data relating to the respective links and nodes, such as bandwidth, traffic patterns, and optionally further boundary parameters , such as the number of database accesses to be carried out, the scope of the selective logging and the like.
Abstract
Description
Claims
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
HU0300069A HUP0300069A2 (en) | 2000-03-22 | 2001-03-02 | Method for automatically allocating a network planning process to at least one computer |
US10/239,303 US20030033438A1 (en) | 2001-03-02 | 2001-03-02 | Method for automatically allocating a network planning process to at least one computer |
CA002403775A CA2403775A1 (en) | 2000-03-22 | 2001-03-02 | Method for automatically assigning a network planning process to at least one computer |
EP01919161A EP1266301A2 (en) | 2000-03-22 | 2001-03-02 | Method for automatically allocating a network planning process to at least one computer |
PL01358174A PL358174A1 (en) | 2000-03-22 | 2001-03-02 | Method for automatically allocating a network planning process to at least one computer |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE10014089A DE10014089A1 (en) | 2000-03-22 | 2000-03-22 | Automatic assignment of network planning process to computer - assigning sub-processes manually and/or automatically to entities, based on detection of parameters evaluating available power and usage of entities, and on determination and/or structuring of sub-processes |
DE10014089.0 | 2000-03-22 |
Publications (2)
Publication Number | Publication Date |
---|---|
WO2001071528A2 true WO2001071528A2 (en) | 2001-09-27 |
WO2001071528A3 WO2001071528A3 (en) | 2002-05-23 |
Family
ID=7635833
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/DE2001/000794 WO2001071528A2 (en) | 2000-03-22 | 2001-03-02 | Method for automatically allocating a network planning process to at least one computer |
Country Status (6)
Country | Link |
---|---|
EP (1) | EP1266301A2 (en) |
CA (1) | CA2403775A1 (en) |
DE (1) | DE10014089A1 (en) |
HU (1) | HUP0300069A2 (en) |
PL (1) | PL358174A1 (en) |
WO (1) | WO2001071528A2 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE102004014629A1 (en) * | 2004-03-19 | 2005-10-06 | Varta Microbattery Gmbh | Galvanic element |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2367970B (en) | 2000-10-09 | 2004-01-21 | Ericsson Telefon Ab L M | Network topologies |
AU2006205055A1 (en) | 2005-01-13 | 2006-07-20 | Hsbc North America Holdings Inc. | Framework for configuration and release management of group systems software |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5522070A (en) * | 1992-03-19 | 1996-05-28 | Fujitsu Limited | Computer resource distributing method and system for distributing a multiplicity of processes to a plurality of computers connected in a network |
US5388268A (en) * | 1992-09-18 | 1995-02-07 | Hewlett-Packard Company | Methods of indicating states of software processes cooperating on a single task |
-
2000
- 2000-03-22 DE DE10014089A patent/DE10014089A1/en not_active Withdrawn
-
2001
- 2001-03-02 EP EP01919161A patent/EP1266301A2/en not_active Withdrawn
- 2001-03-02 HU HU0300069A patent/HUP0300069A2/en unknown
- 2001-03-02 CA CA002403775A patent/CA2403775A1/en not_active Abandoned
- 2001-03-02 WO PCT/DE2001/000794 patent/WO2001071528A2/en not_active Application Discontinuation
- 2001-03-02 PL PL01358174A patent/PL358174A1/en not_active Application Discontinuation
Non-Patent Citations (3)
Title |
---|
D. H. J. EPEMA, M. LIVNY, R. VAN DANTZIG, X. EVERS, J. PRUYNE: "A worldwide flock of Condors: Load sharing among workstation clusters" FUTURE GENERATIONS COMPUTER SYSTEMS, ELSEVIER SCIENCE PUBLISHERS. AMSTERDAM, NL, Bd. 12, Nr. 1, 1. Mai 1996 (1996-05-01), Seiten 53-65, XP004018257 ISSN: 0167-739X * |
MATTHIAS BRUNE, J\RN GEHRING, AXEL KELLER, BURKHARD MONIEN, FRIEDHELM RAMME, ALEXANDER REINEFELD: "Specifying resources and services in metacomputing environments" PARALLEL COMPUTING, ELSEVIER PUBLISHERS, AMSTERDAM, NL, Bd. 24, Nr. 12-13, 1. November 1998 (1998-11-01), Seiten 1751-1776, XP004142118 ISSN: 0167-8191 * |
ULRICH GREMMELMAIER, MARTIN WINTER, PETER JOCHER: "The PNNI Emulator: A Versatile Tool for Planning and Operation Support of PNNI Networks" PROCEEDINGS OF THE INTERNATIONAL TELECOMUNICATION NETWORK PLANNING SYMPOSIUM, 1998, Seiten 147-152, XP008000085 * |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE102004014629A1 (en) * | 2004-03-19 | 2005-10-06 | Varta Microbattery Gmbh | Galvanic element |
Also Published As
Publication number | Publication date |
---|---|
EP1266301A2 (en) | 2002-12-18 |
CA2403775A1 (en) | 2001-09-27 |
DE10014089A1 (en) | 2001-09-27 |
WO2001071528A3 (en) | 2002-05-23 |
PL358174A1 (en) | 2004-08-09 |
HUP0300069A2 (en) | 2003-05-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
DE19746904B4 (en) | Traffic data evaluation device and associated method for a network with dynamic switching | |
DE69534334T2 (en) | A high performance graphical representation of network topology | |
DE602005001965T2 (en) | Methodology and protocols for high-speed traffic measurement and analysis | |
DE60024228T2 (en) | DYNAMIC ASSIGNMENT TRAFFIC CLASSES ON A PRIORITY MAINTENANCE JUMP IN A PACKAGE TRANSPORT DEVICE | |
DE60217361T2 (en) | Method and system for overload control in a communication network | |
DE69927252T2 (en) | On the monitoring of buffer occupancy based planning of network capacity | |
DE69931841T2 (en) | Resource allocation and routing procedures in multi-user private virtual networks | |
DE69725261T2 (en) | System for the transmission of network traffic in a communication network | |
DE60116178T2 (en) | Root cause analysis in a distributed network management architecture | |
DE69925557T2 (en) | Monitoring the throughput of a computer system and a network | |
DE69632240T2 (en) | Method and system for controlling transmission speeds of sources in ATM networks | |
DE60022151T2 (en) | Measurement-based management method for packet-oriented communication networks | |
DE69634541T2 (en) | ARRANGEMENT AND METHOD WITH REGARD TO PACKAGE FLOW CONTROL | |
DE112006002841B4 (en) | Network unit and programmable controller using the same | |
DE102006024965A1 (en) | Method for measuring a time delay metric and measuring system | |
EP0902600B1 (en) | Method for establishing logical connections in a synchronous digital data communication network , network element and management system | |
EP0903959A2 (en) | Method for transmitting data packets and network elements suitable for the execution of this method | |
EP1128602B1 (en) | Apparatus for building a protocol stack and corresponding method | |
DE10023037A1 (en) | Switching network for a telecommunications network and method for switching in a switching network | |
DE102004005016B4 (en) | Method for controlling the transport capacity for data transmission over a network and network | |
WO2001071528A2 (en) | Method for automatically allocating a network planning process to at least one computer | |
DE602004003690T2 (en) | METHOD AND SYSTEM FOR SERVICE QUALITY OPTIMIZATION IN A DATA NETWORK | |
DE69735259T2 (en) | A node device and method of using a virtual connection to transmit a packet | |
DE60206874T2 (en) | A method and apparatus for providing a flow with minimal congestion of Ethernet traffic transmitted over the SDH / SONET network | |
DE602005003710T2 (en) | Method for providing OAM support in a multicast communication session |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A2 Designated state(s): CA HU IN PL US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A2 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
AK | Designated states |
Kind code of ref document: A3 Designated state(s): CA HU IN PL US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A3 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2001919161 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10239303 Country of ref document: US Ref document number: 2403775 Country of ref document: CA |
|
WWP | Wipo information: published in national office |
Ref document number: 2001919161 Country of ref document: EP |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 2001919161 Country of ref document: EP |