WO1995017075A1 - Network updating arrangement - Google Patents
Network updating arrangement Download PDFInfo
- Publication number
- WO1995017075A1 WO1995017075A1 PCT/GB1994/002752 GB9402752W WO9517075A1 WO 1995017075 A1 WO1995017075 A1 WO 1995017075A1 GB 9402752 W GB9402752 W GB 9402752W WO 9517075 A1 WO9517075 A1 WO 9517075A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- switch
- links
- switches
- network
- update status
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/0016—Arrangements providing connection between exchanges
- H04Q3/0062—Provisions for network management
Definitions
- Commumcanons networks will generally comprise communication channels, or links, connected by exchanges, or switches.
- the route taken by data (or voice messages) travelling from one ser of terminal equipment via the network to another set of terminal equipment is determined by the switches.
- the capacity that is the maximum amount of data, which can be transported in a fixed length of time, can be limited by the nature of the links. However, much more significantly, the service which can be provided on those links can be dictated by the exchange design. If a network operator wants to update the services it can offer to customers, it must then first update its exchanges.
- Telecommunications PLC is both large scale and high profile.
- a network updating arrangement for a network which comprises a plurality of communication links with associated switches, each switch having an update status selected from at least two alternative statuses, the service capabilities of each link being functionally affected by the update status of at least one switch, and the links being grouped according to allocated identifiers, each group sharing a common identifier, the arrangement comprising a database system for logging an update status indicator for each switch, the database system comprising data stored in at least two different data structures, these comprising a link data structure and a switch data structure, the link data structure logging for each link of the network its allocated identifier or identifiers and all switches whose update status functionally affects the service capabilities of that link, and the switch data structure providing for each switch an index to the link data structure, logging thereby all links whose service capabilities are functionally affected by the update status of that switch, and storing for each switch the update status indicator, the arrangement further comprising data input means to the link data structure, for selecting, in respect
- the common identifier can be for instance related to a particular customer.
- a solution can be generated to the problem of providing a minimum number of links of increased service capabilities to specified customers.
- a network updating arrangement for a network which comprises a plurality of communication links with associated switches, each switch having an update status selected from at least two alternative statuses, the service capabilities of each link being functionally affected by the update status of at least one switch, and the links being grouped according to allocated identifiers, each group sharing a common identifier, the arrangement comprising a database system for logging an update status indicator for each switch, the database system comprising data stored in at least two different data structures, these comprising a link data structure and a switch data structure, the link data structure logging for each link of the network its allocated identifier or identifiers, a service capability indicator, and all switches whose update status functionally affects the service capabilities of that link, and the switch data structure providing for each switch an index to the link data structure, logging thereby all links whose service capabilities are functionally affected by the update status of that switch, and storing for each switch the update status indicator, the arrangement further comprising data input means to the switch data
- Network updating arrangements of this second type are structurally similar to those according to the first aspect of the present invention, but can be driven from data representing a selection of switches for updating, rather than from data representing a selection representing link capacity per selected customer.
- a network updating arrangement will incorporate both aspects described above.
- a method of updating a communications network which network comprises a plurality of communication links with associated switches, each switch having an update status selected from at least two alternative statuses, the service capabilities of each link being functionally dependant on the update status of at least one switch, and the links being grouped according to allocated identifiers, each group sharing a common identifier, wherein the method comprises: i) storing an indicator indicating the update status for each switch, in a first data structure of a database system; ii) logging all links whose service capabilities are functionally affected by the update status of each switch, by means of a plurality of indexes to a second data structure of said database system; iii) selecting, in respect of one or more identifiers, a minimum number of links in the group of links for which it is the common identifier; and iv) identifying an optimal set of switches, selected from the switches of the network, for
- the identification of an optimal set of switches is carried out by means of a simulated annealing technique.
- a method as described above might optionally include the steps of selecting a set of switches and changing the update status indicator of each switch of said set and identifying the links whose service capabilities would be changed as a consequence of a corresponding change in update status for the switches of said set.
- Simulated annealing is a known problem solving technique in which one starts with a random solution to the problem and then varies parameters arbitrarily, looking at the effect on the solution. If the effect is beneficial, the parameter changes are accepted.
- the simulated annealing technique is one of several known problem solving techniques. It is a fourth aspect of the present invention that there is provided a network updating arrangement based on the use of simulated annealing functionality.
- Embodiments of the present invention allow one or more selected parameters to drive the process.
- an initial constraint is selected to be that a minimum service capability be provided to each customer
- the lowest level of operation which might be made available for parameter variation in order to move towards a solution might be simply to start with the condition that 100% of exchanges are updated and then to delete identified exchanges until a solution can no longer be reached.
- operations available in a simulated annealing process for use in a network updating arrangement, comprise "toggle exchanges" and "flip exchanges".
- these operations are respectively to select an exchange at random and change its update status, from off to on or from on to off depending whether it was initially off or on, and to select at random two exchanges having different update statuses and swapping their update statuses. That is, in a
- Figure 1 shows a flow diagram for a network updating arrangement according an embodiment of the present invention
- Figure 2 shows a first data structure for use in carrying out the process represented by the flow diagram in Figure 1;
- Figure 3 shows a second data structure for use in carrying the process represented by the flow diagram in Figure 1;
- Figure 4 shows apparatus for providing the network updating arrangement represented by Figure 1;
- Figure 5 shows a flow diagram for the core structure of a simulated annealing technique for use in the network updating arrangement represented by Figure 1.
- the problem which is probably most difficult to solve is that of satisfying minimum requirements in terms of service capabilities for selected, or all, customers in a manner representing least cost/delay for the network operator.
- minimum requirements in terms of service capabilities for selected, or all, customers in a manner representing least cost/delay for the network operator.
- scenarios which might be met For instance:
- ⁇ wire-id> is a unique identifier for the wire, as used in the CAMMS database.
- ⁇ supporting-exchange> is an exchange that must be present in order for this wire to be supported.
- ⁇ dependant-customer> is a customer who is dependant upon the wire.
- a wire is supported for improved services if and only if all its supporting exchanges are to be upgraded.
- An exchange can be in one of two states • to be ungraded or on. • not to be upgraded or off.
- a valid solution is a set of exchanges that are to be marked on, such that each customer has at least the minimum percentage of wires supported.
- the solution is notionally represented as a bit set. If the i , member of the bit set is 1 then the i Ih exchange is to be upgraded. If the i th member of the bit set is 0 then the i , exchange is not to be upgraded.
- the starting point for a problem solving operation might be the requirement that certain wires must be supported. This might be a minimum percentage for each customer, or specific wires chosen by the customer from a set.
- the simulated annealing process then performs operations upon an initial solution with a view to minimising the number of exchanges marked on, subject to the bit set denoting a valid solution.
- cons ⁇ der_on_change( ) the change in the number of exchanges is +1 and in the case of cons ⁇ der_off_change(), -1.
- cons ⁇ der_off_change( ) Stopping in the middle of cons ⁇ der_off_change( ) is not safe if it is followed immediately by a cons ⁇ der_on_change( ). Cons ⁇ der_off_change( ) could stop prematurely because customer X was no longer satisfied, only to find that consider_on_change() would correct the problem. Therefore, an additional argument is given to consider_off_change( ) to indicate when it is safe to perform this optimisation. Performance is aided by arranging for calls to be structured in such a way the optimisation is possible. Once the potential effects of turning an exchange on or off are realised it is necessary to determine whether all customers' required minimum percentage of wire is met. As this task is common to both on and off changes it is performed in one function (consider_on_off_change() ). This function acts as a wrapper that hides consider_on_change( ) and consider_off_change( ).
- make_on_off_change( ) modifies the number of wires per customer and not a copy of this value.
- TOGGLE As mentioned above, there are two relatively important high-level operations provided by embodiments of the present invention. These are the TOGGLE and SWITCH operations.
- the first operation (TOGGLE) is the simplest and the only one that can lead to direct improvements in the solution. It selects at random a bit in the solution set and toggles its value. That is to say, it selects an exchange at random and, if it is on marks it off or if it is off marks it on. This operation is trivially supported by consider_on_off_change( ).
- TOGGLE Whilst TOGGLE can quickly reduce the number of exchange, it may also get trapped in a local minimum.
- SWITCH The second operation (SWITCH) is used to get out of local minima. It selects at random two exchanges, one that is on and one that is off. It then toggles both exchanges at the same time.
- A, B and C are caught in some sort of embrace such that all three of them can combine with other exchanges to support all customers but it is not possible to turn off any one of them and still satisfy all customers. It would, however, be possible to turn A, B, C all off and then turn D and E on and still satisfy all customers. This would be a better solution as it would require one less exchange.
- the SWITCH requires one exchange that is on and one that is off. If the initial solution consists of only exchanges that are on, then the SWITCH cannot be applied. An implementation might loop indefinitely trying to randomly select an exchange that was off. It is therefore necessary only to apply the SWITCH when there is at least one off exchange. However, it should be noted that the real value of the SWITCH is in escaping from local minima and that applying it too early is unnecessary. It is therefore possible to control when the SWITCH operation is performed by setting a FLIP parameter to an upper limit of the proportion of exchanges that are on before the SWITCH is employed.
- the SWITCH operation will only be performed when 70% or less of the exchanges are marked on.
- the TOGGLE operation is selected with a probability P.
- the SWITCH operation is selected with a probability 1-P.
- the default value of P is controlled by DEFAULT_OP1_PROB and might for instance be set to 0.5.
- the process and operations described above are based on simulated annealing.
- the value of the temperature variable is as crucial in this annealer as it is in any other. Set the initial value too high and early work consists of purely random modifications. Set the initial value too low and only improvements are possible and the annealer degenerates to a randomised hill climber.
- a simulated annealing operation in general, one starts with a random solution. In the context of a network updating arrangement, this might be that all exchanges (switches) will be updated in order to achieve 10% of wires per customer having increased service capabilities.
- the annealing process then applies the two high level operations, TOGGLE and SWITCH, randomly to the solution. If the solution is improved, the system will accept the new solution, but if it worsens, it will only accept the new solution if it is likely the new solution in the long term will generate a better final solution. That decision is made at least partly in accordance with the "temperature", this representing a measure of the time taken or number of operations already performed by the system. The temperature is set initially at a value selected by experimentation, and reduced automatically by the system, for instance linearly with time or as a function of the number of iterations performed at each temperature.
- a flow diagram showing the core structure of the annealer can be set out as follows.
- An operation starts at STEP 500.
- the operator sets an initial temperature, decided after previous experimentation to achieve a reasonable starting point.
- the core structure then establishes a first loop, STEP 502, so that the process will repeat for a fixed number of iterations.
- the core structure establishes a second loop based on "nsucc".
- "nsucc" is set at zero, STEP 503.
- the second loop is then established to run a fixed number of times, "num_over", STEP 504.
- This second loop takes individual exchanges and chooses whether a TOGGLE or a SWITCH operation is appropriate, STEP 507, and looks at the cost of the selected operation for each exchange in the light of the current temperature, STEPS 505, 506.
- the status of each exchange is then either changed or left unchanged, STEPS 505, 506, dn *.c ⁇ 2»-. an. IS uAlfr ' twA-tA .
- the core structure will exit the second loop either because "j" has reached “num_over” or because an "NLIMIT” condition applies, STEP 508. This is the condition, discussed above, which allows the operation to move on, reducing the temperature more quickly, in the event that too many results are positive, indicating that the temperature was originally set too high.Jfc i ⁇ "N i Mt r " ' M i ci/, ' -ti 5 n ⁇ c
- the core structure will exit the first loop when a preselected limit on the number of iterations has been reached, STEP 509. Otherwise, the temperature is stepped down, STEP 510, and the second loop re-entered.
- step 1 START. It will accept an initial solution at step 2, for instance upgrading 95% of exchanges to achieve 20% increase in lines offering improved service capabilities.
- step 3 is another data input step, the operator setting an initial temperature. The operator may at this stage also set "T_FACTOR", discussed above.
- the COST variable is set to the cost of the initial solution selected.
- step 6 the system applies the randomly selected operation to the current solution. If the resultant cost, NEWCOST, is less than the cost set at step 4 above, then NEWCOST is accepted, these being steps 7 and 8. If, however, NEWCOST is not less than the SOLNCOST set at step 4 above, the system may still accept NEWCOST. It now applies step 9, that is it calculates the current value of a function of the temperature and of the relationship between NEWCOST and COST. In the light of this function, at decision step 10, the system will either decide to accept the NEWCOST, reverting to step 8, or abandon NEWCOST in favour of the previous SOLNCOST, at step 11.
- step 12 there is a decision step 12 at which the system may decide the latest cost is acceptable as a final solution. If this is the case, the system proceeds to END, step 13. If, however, various conditions apply, such as the temperature remaining high or the latest value of COST being high, the system will make a check, step 14, as to whether the temperature is due to be changed, change or not change the temperature accordingly, and return to step 5, selecting the next operation to apply.
- the system described above can be put into operation using a standard computer.
- the computer has to be organised to provide relevant data structures and it is convenient to provide at least two related data structures, described as follows.
- data structures 20 associated with an individual wire are shown.
- the main one is the pw_table 21.
- Each entry includes the wire-id (a string) as well as an indication of its type (KILOSTREAM, MEGASTREAM etc).
- KILOSTREAM, MEGASTREAM etc an indication of its type
- Each wire is supported by a number of exchanges.
- the list of exchange numbers is stored in the support table 23 and each pw_table entry 22 indicates the start and length of the list relevant to it.
- the first entry 22 in the pw_table 21 has three supporting exchanges 24.
- Each wire is required by a number of customers. This is usually one, but can be more.
- the list of customer numbers is stored in the dependant_table 25.
- the first entry 22 in the pw_table 21 is required by two customers.
- the number of entries in the support_table 23 cannot be determined easily but it is calculated by mapper (not shown) and thereafter stored in shared memory (nsupports). Similarly with the number of entries in the dependant_table 25. Both of these arrays need only store small numbers and therefore size is not a problem. Data in these arrays is not manipulated during run-time.
- each exchange contains an index 33 in the pw_table 21, indicating the wires supported by this exchange. If two exchanges support the same wire then one entry in each of their tables will point to the same entry 34 in the pw_table 21. This is shown in Figure 3.
- the number of entries in the exchange table 3 is equal to the number of exchanges (nexchange).
- the number of entries in the individual tables is equal to the number of wires supported by that exchange.
- the total number of entries in the individual tables should be equal to the number of entries in the support_table 23.
- the solution arrived at is a list indicating which exchanges are to be upgraded and which are not. This is represented by an array of 1 s and 0 s, with one entry for each exchange. If the i th entry is 1, then the i th exchange is to be upgraded.
- the hardware used to run the simulated annealing operation will have a user interface.
- step 1 to start the system off, and before the user interface can be started, the shared memory containing the data structures 20, 30 described above has to be created. This will be done in a manner determined by the file structures and directory structures employed in setting up the system.
- suitable user interfaces 400 for use in embodiments of the present invention are known and can provide both data input means and indicator means.
- the user interface 400 may be a screen 402 showing a "customer browser" layout, the user being provided with a mouse to move an on-screen cursor 403 to select and change fields.
- the screen layout can be changed, for instance to a "control panel” layout 404.
- Data can be input, for instance via the "Number of i tera tions" field 405, and information can be displayed, for instance in relation to a selected customer by means of a further alternative "Customer Details", screen layout 406.
- the progress of an annealing operation to find an optimal solution can also be monitored using an appropriate screen layout.
- the following optimal screen layouts, together with the customer browser layout, can give considerable control to a user over the statistics the system is used to generate or view.
- the "Customer Browser Window” provides the main point of the user interface 400. It can list all customers alphabetically and allow selection of a particular customer with the mouse. It can also show dynamically the current solution in terms of the number of exchanges to be upgraded, and consequently the number of channels to be upgraded. The total number of wires can also be shown.
- the " customer browser” has buttons that allow starting the program (Run) 420, stopping it during execution (Stop) 421, quitting the application (Quit) 422, saving the current state (Save/Save As) 423 and restoring a saved state (Load) 424.
- the " control panel” can be displayed by pressing the "Control Panel” button 430 on the customer browser window.
- the user can select an appropriate mode for the tool (minimum cost or maximum customer satisfaction).
- the user can set a default allocation (the percentage of each customer' s channels that must be upgraded) and the number of iterations (the time the annealer is allowed to reach a solution).
- the Flag menu 407 allows the user to select one of the three main uses of the annealer: "normal” means the annealer should minimise the number of exchanges used while achieving the desired allocation rates.
- annealer should use the number of exchanges indicated in the Flag Value field 408 but maximise the number of channels that can be allocated
- Exchange List means that the file named in Flag Value 408 contains a list of exchanges and the annealer should determine what allocation would be achieved if these exchanges were upgraded. More sophisticated control over allocation rates can be achieved by setting different rates for different customers. This is provided for by selecting a customer from the customer browser, and pressing the View Customer button,+- ⁇ - In Figure 4, Customer 105 has been selected and their details will then be shown in the "Customer Details" screen layout 406.
- the only editable field in the "customer details" window 406 is the one specifying the desired allocation; any entry in it will override the default allocation percentage set in the control panel and is valid for that customer only. In the example shown, Customer 105 will have a minimum of 30% of their wires allocated, while the rate is only 10% for all other customers.
- the Exchange Browser 440 allows the user to supply additional constraints on exchanges. It is displayed by pressing the Edit Exchanges button 431 in the customer browser window.
- the exchange browser 440 displays alphabetically the exchanges that are currently upgraded/not upgraded. Each exchange can be selected with the mouse, or an exchange name can be manually entered in the space provided. Then the exchange can be set to free (the program may decide if it should be upgraded), on (this exchange must be upgraded) or off (this exchange must be upgraded). By default, all exchanges are free.
- An arrangement according to an embodiment of the present invention can allow the user to specify that certain wires must be upgraded. As there may be several hundred thousand of them, this might be done on a per customer exchange basis.
- a customer is selected from the customer browser, then the button Edit Customers Wires 460 is pressed. This will display an "Edit Wires" screen layout, showing all the exchanges at which the customer owns wires. The user then selects an exchange at which wires are of interest, and presses an "Apply” button. This lists the wires the customer owns at that exchange. Selecting a wire and setting it to "on” using a toggle menu provided ensures that this wire will be upgraded by setting all exchanges this wire is connected to to "on”.
- the user interface 400 of Figure 4 can also act as the indicating means for results of a planning operation. It can display a solution in at least three different ways: i) As a table showing the customers, the number of wires and channels owned by them, and their desired and achieved upgrade levels. Note there might be a minimum allocation percentage for each customer, such as 10% set by means of the control panel screen display, but a different minimum allocation percentage, such as 30%, might be set for a selected Customer.
- the output file is suitable to be loaded into a spreadsheet.
- a complete breakdown can be shown by selecting a customer, and then pressing the right mouse button. This displays a popup menu with three choices: viewing all wires, viewing all upgraded wires or viewing all wires that were not upgraded. ii) As a list of exchanges that were/were not upgraded. This is achieved by displaying an "exchange browser" screen layout after the program has been run. iii) As a map showing the location of exchanges that were upgraded, either as a complete solution or for one or more selected customers.
- upgrading arrangements according to embodiments of the present invention can be used to generate solutions in upgrading processes in times of the order of an hour or two, that is, approximately 10 times as quickly as arrangements previously used.
- embodiments of the present invention can also be extremely versatile since the user can input any of a range of constraints to the process so that the "what if?" scenario can be solved for many different starting points.
- the core structure, described in relation to Figure 5, simply provides a basis which can then be built on to look at many different scenarios in a complex environment.
- a communications network updating arrangement comprising a data store, a data processor configured to apply a simulated annealing technique to data from the data store, a data and control input for controlling, and applying constraints to, the operation of the data processor in applying the simulated annealing technique, and a results indicator for showing the results of applying the simulated annealing technique to the data.
- the data could be said to identify links of the network and to comprise the update status of switches of the network.
- the update status in this context will potentially constrain the capacity of one or more associated links to be used in providing a service or services.
- the data store may be said to comprise at least two data structures, a first for holding data concerning links of the network and a second for holding data concerning switches of the network.
- the data concerning switches of the network might comprise an index to the first data structure so as to identify any link or links whose capacity may be constrained by the update of individual switches.
- input data to the planning tool is a number of business customers owning private wires served by links in a network comprising 6, 000 exchanges. About 4, 000 customer premises are involved and there is a total of just under 450,000 private wires, amounting to just under 700,000 channels.
- the planning tool which can of course be used without the "front end" described above, has functionality to allow specification of minimum upgrade levels, a fixed number of exchanges to be upgraded, and a proposed solution. Planning in phases can also be supported, and solutions can be saved and restored.
- TOGGLE operations In a planning operation where cost is a constraint, of the two operations TOGGLE and SWITCH, TOGGLE operations from on to 22a
- TOGGLE operations from off to on will increase cost but will be accepted with a probability proportionate to the number of channels that can be upgraded with the particular exchange.
- a SWITCH operation will of course generally be accepted if the operation results in a net gain in the number of channels supported. If there is a net loss, it will only be accepted in a manner inversely proportional to the net loss. Thus, where there are dominant cost constraints, the tool will be biased towards updating large exchanges. However, a minimum upgrade level can be specified where a minimum number of channels must be upgraded for each customer.
- a major upgrade programme may have to be done in stages.
- a planning tool according to an embodiment of the invention can support planning in stages, generally there will be a worse overall result because, having completed the first stage, some exchanges will become upgraded and therefore "fixed". It may be a constraint that a fixed number of exchanges must be upgraded, in addition to there being a cost constraint. With this combination, the tool will tend to select exchanges that provide maximum value for money, ie those that allow the maximum number of channels to be upgraded, without regard to the distribution of upgraded channels over customers. It is possible to overcome this tendency to an uneven result by adding the " inimum upgrade" contraint so that customers get at least a minimum level of improved services or capacity.
Abstract
Description
Claims
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP95903430A EP0734633A1 (en) | 1993-12-16 | 1994-12-16 | Network updating arrangement |
CA002179185A CA2179185A1 (en) | 1993-12-16 | 1994-12-16 | Network updating arrangement |
AU12482/95A AU1248295A (en) | 1993-12-16 | 1994-12-16 | Network updating arrangement |
US08/507,316 US6023562A (en) | 1993-12-16 | 1994-12-16 | Network updating arrangement using simulated annealing process to select level of service capabilities of permanent grouped communication links without changing network topology |
JP7516618A JPH09506751A (en) | 1993-12-16 | 1994-12-16 | Network updater |
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP93310182.6 | 1993-12-16 | ||
EP93310182 | 1993-12-16 | ||
US20889694A | 1994-03-14 | 1994-03-14 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO1995017075A1 true WO1995017075A1 (en) | 1995-06-22 |
Family
ID=8214642
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/GB1994/002752 WO1995017075A1 (en) | 1993-12-16 | 1994-12-16 | Network updating arrangement |
Country Status (6)
Country | Link |
---|---|
EP (1) | EP0734633A1 (en) |
JP (1) | JPH09506751A (en) |
AU (1) | AU1248295A (en) |
CA (1) | CA2179185A1 (en) |
SG (1) | SG48509A1 (en) |
WO (1) | WO1995017075A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103558602A (en) * | 2013-08-14 | 2014-02-05 | 西北工业大学 | Simulated annealing locating method for multi-base sonar configuration mode |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5067148A (en) * | 1990-12-14 | 1991-11-19 | Nynex Corporation | Method and apparatus for planning telephone facilities networks |
US5216591A (en) * | 1990-02-06 | 1993-06-01 | Sprint International Communications Corp. | Method for efficient distributed data communications network backbone node location |
-
1994
- 1994-12-16 JP JP7516618A patent/JPH09506751A/en active Pending
- 1994-12-16 WO PCT/GB1994/002752 patent/WO1995017075A1/en not_active Application Discontinuation
- 1994-12-16 CA CA002179185A patent/CA2179185A1/en not_active Withdrawn
- 1994-12-16 EP EP95903430A patent/EP0734633A1/en not_active Withdrawn
- 1994-12-16 AU AU12482/95A patent/AU1248295A/en not_active Abandoned
- 1994-12-16 SG SG1996012343A patent/SG48509A1/en unknown
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5216591A (en) * | 1990-02-06 | 1993-06-01 | Sprint International Communications Corp. | Method for efficient distributed data communications network backbone node location |
US5067148A (en) * | 1990-12-14 | 1991-11-19 | Nynex Corporation | Method and apparatus for planning telephone facilities networks |
Non-Patent Citations (3)
Title |
---|
CRAVEIRINHA ET AL.: "A survey of applications of mathematical programming to circuit-switched network planning problems", EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS AND RELATED TECHNOLOGIES, vol. 3, no. 5, September 1992 (1992-09-01), MILANO IT, pages 499 - 515, XP000315368 * |
IKEUCHI: "Network constructing algorithm based on link significance evaluation - NABLE", ELECTRONICS & COMMUNICATIONS IN JAPAN, PART I - COMMUNICATIONS, vol. 73, no. 2, February 1990 (1990-02-01), NEW YORK US, pages 30 - 41, XP000140238 * |
LIN ET AL.: "A framework for learning and inference in network management", IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE - GLOBECOM 92, vol. 1, 6 December 1992 (1992-12-06), ORLANDO US, pages 560 - 564, XP000357845 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103558602A (en) * | 2013-08-14 | 2014-02-05 | 西北工业大学 | Simulated annealing locating method for multi-base sonar configuration mode |
CN103558602B (en) * | 2013-08-14 | 2016-04-06 | 西北工业大学 | A kind of simulated annealing localization method for many bases sonar configuration mode |
Also Published As
Publication number | Publication date |
---|---|
EP0734633A1 (en) | 1996-10-02 |
AU1248295A (en) | 1995-07-03 |
JPH09506751A (en) | 1997-06-30 |
CA2179185A1 (en) | 1995-06-22 |
SG48509A1 (en) | 1998-04-17 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP7256279B2 (en) | Method, device, computer program and electronic device for grouping operating units | |
US4862498A (en) | Method and apparatus for automatically selecting system commands for display | |
JP3173102B2 (en) | Network management operation system and management operation processing method | |
US5323452A (en) | Visual programming of telephone network call processing logic | |
EP0460843B1 (en) | Network planning tool | |
Altman et al. | On optimal call admission control in resource-sharing system | |
US5623541A (en) | Apparatus to manipulate and examine the data structure that supports digit analysis in telecommunications call processing | |
US5345380A (en) | System and processes specifying customized customer telecommunication services using a graphical interface | |
US5966123A (en) | Meta model editor controlling topic display application | |
JPH07273760A (en) | Method for routing online virtual circuit | |
CN106201409A (en) | The processing method at a kind of application program operation interface and system | |
US6023562A (en) | Network updating arrangement using simulated annealing process to select level of service capabilities of permanent grouped communication links without changing network topology | |
EP1092326B1 (en) | Call routing data management | |
EP0734633A1 (en) | Network updating arrangement | |
CA2222702A1 (en) | Graphic control process for controlling operations in a network management system | |
CN106909367A (en) | Desktop display method and device in a kind of terminal device | |
US5734708A (en) | Optimizing the capacity a telecommunication system | |
US6693876B1 (en) | Selecting IPX/IGX nodes in a multi-domain environment | |
US5373553A (en) | Automatic generation of control messages for a communication network based on input of parameters to be modified | |
US8271883B2 (en) | Intelligent auto-creation of new portlets | |
CN108520025A (en) | A kind of service node determines method, apparatus, equipment and medium | |
CN106911595A (en) | A kind of Openflow message performs method and device | |
KR0146643B1 (en) | Method for controlling the senario of atm vp exchange system | |
CN116301458A (en) | Message processing method, device, electronic equipment and storage medium | |
JPS6374251A (en) | Trunk selection system in private branch exchange |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AU CA CN JP KR NZ US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AT BE CH DE DK ES FR GB GR IE IT LU MC NL PT SE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 08507316 Country of ref document: US |
|
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2179185 Country of ref document: CA |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1995903430 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1995903430 Country of ref document: EP |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 1995903430 Country of ref document: EP |