WO2007070914A1 - Service designs for communications networks - Google Patents
Service designs for communications networks Download PDFInfo
- Publication number
- WO2007070914A1 WO2007070914A1 PCT/AU2005/001943 AU2005001943W WO2007070914A1 WO 2007070914 A1 WO2007070914 A1 WO 2007070914A1 AU 2005001943 W AU2005001943 W AU 2005001943W WO 2007070914 A1 WO2007070914 A1 WO 2007070914A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- design
- network
- permutation
- model
- permutations
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/42136—Administration or customisation of services
- H04M3/4217—Managing service interactions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/22—Arrangements for supervision, monitoring or testing
- H04M3/2254—Arrangements for supervision, monitoring or testing in networks
- H04M3/2263—Network management
Definitions
- the invention relates to the field of telecommunications, and particularly to the design of communications networks.
- Telecommunications networks are complex mixtures of equipment and mediums. For example, a point-to-point telephone call can pass through a local PABX, a local exchange, and a central exchange, then be routed through a separate local exchange and ultimately to the handset of the other party. Where the other party is located in another country there can be a far greater array of paths and equipment, including undersea cables and satellite links.
- Telecommunications networks carry many forms of 'signals', including voice, ATM, packet data, Internet Protocol Data and mobile telephony.
- the networks are constituted by wired, wireless (including RF and microwave) and f ⁇ breoptic components.
- Provisioning includes the situations of: the installation of new networks services, the rearrangement of existing network services, and the decommissioning or termination of existing network services.
- the output of a provisioning process - in response to a provisioning request - is a "plan". It is desirable to automate network provisioning requests as much as possible.
- the ideal situation is 'zero-touch' provisioning, where the necessary actions are taken without any human intervention. However, this is practically not possible given the variety of equipment and infrastructure in existing networks.
- PDH Plesiochronous Digital Hierarchy a technology used in telecommunications networks to transport large quantities of data over digital transport equipment such as fibre optic and microwave radio systems
- SDH Synchronous Digital Hierarchy - is a standard for communicating digital information using lasers or light emitting diodes (LEDs) over optical fiber as defined by GR- 253-CORE
- ATM Asynchronous Transfer Mode - ATM is a connection oriented packet switching technology with guaranteed Quality of Service making use of dynamic bandwidth allocation
- Trail A connectivity entity responsible for the transfer of information between different Network Elements. It performs signal assembly and multiplexing function and terminates on Termination Points.
- Subnetwork A transport entity which is capable of transferring information between Termination Points across a subnetwork. It is configured as part of trail management process.
- Network element A single managed entity in the Network which consists of a number of Equipment and logical Termination Points and may or may not be geographically distributed.
- Node represents a physical location such as a plot of land, and houses the telecommunication network infrastructure identified with an address and geographical coordinates.
- provisioning strategies tend only to operate at one layer of the ISO open system interconnection reference model. Such solutions have the drawback of not taking into account customer service levels or business rules relating to the network's operation. Additionally, it is inevitably the case that provisioning requests must, in practise, cope with multi-layer, multi-technology solutions to provisioning the network.
- a method for producing a service design for a communications network in response to a provisioning order specifying a change to the network between a start node and an end node and at least one condition attaching to that change comprising the steps of: selecting a design model satisfying said at least one condition, the design model including at least information on design items related to the network resources; determining all design permutations of the design items of the selected design model; preferentially ranking the design permutations; and comparing each ranked design permutation in turn against a network model to find a permutation matching the specified start and end nodes, the matching design permutation then becoming the service design.
- a computer system for producing a service design for a communications network in response to a provisioning order specifying a change to the network between a . start node and an end node and at least one condition attaching to that change
- the system comprising: a memory store storing a plurality of design model; and a processor to select a said design model satisfying said at least one condition, the design model including at least information on design items related to the network resources, determine all design permutations of the design items of the selected design model, preferentially rank the design permutations, and compare each ranked design permutation in turn against a network model to find a permutation matching the specified start and end nodes, the matching design permutation then becoming the service design.
- the comparing step selects the first matching design permutation.
- the permutations can be ranked according to the decision points in each design item. Furthermore, the ranking can be performed by an explode sequence operation and sequential ordering of permutations as they arise during said explode sequence operation. Design permutations that do not satisfy predetermined network rules can be excluded.
- the design model exists within a set of predetermined such models.
- a computer program product is also disclosed.
- Fig. 1 is a schematic block diagram of a representative network architecture.
- Fig. 2 is a schematic block diagram of a system for producing Design Models.
- Fig. 3 is a block flow diagram of the production of a service design in broad terms.
- Fig. 4 is a block flow diagram of the development of a set of product models.
- Fig. 5 shows an example product model.
- Fig. 6 is a block flow diagram of an embodiment of the production of a service design.
- Fig. 7 is a schematic block diagram of a computer hardware platform on which an embodiment can be implemented. Detailed Description of the Preferred Embodiments
- Design Product represents the engineering rules for designing a service.
- Design Model One way of designing the service end-to-end, as a list of
- Design Items Design Item A placeholder that will become a component in the resulting service design.
- the Design Item is a set of selection criteria for finding a suitable network resource.
- Product Model A suite of design products, design models and design items that describe the design of the service. There can be one or more such Product Models.
- Fig. 1 is a generalised, representative network architecture 10 including discrete networks, network elements and nodes.
- NodeA 12, NodeB 14 and NodeF 16 are interconnected by sub-network SDHa 18.
- NodeF 16 includes a cross-connect 20 linking networks common to NodeF 16.
- Nodel 22 is interconnected with NodeF 16 by the sub-network SDHc 24.
- Nodel 22, NodeJ 26 and Node H 28 are interconnected by the sub-network SDHd 30.
- NodeH 28 also include a cross-connect 32.
- NodeE 34, which includes a cross-connect 36, and NodeC 38, which also includes a cross-connect 40, are interconnected by the sub-network SDHb 42.
- NodeD 44 is connected with NodeD 44 by the link PDHa 45.
- NodeD 44 is also connected with NodeG 46 by the link PDHb 48.
- the cross-connects 20, 28, 36 provide connectivity to the ATM network 49.
- a trail can be formed between any one of the nodes 12, 14, 16, 22, 26, 28, 34, 38, 44, 47, passing through one or more of the ATM network 48 and the sub-networks 18, 24, 30, 42 or the links 45, 48.
- the number of nodes can be in the tens of thousands, the number of sub-networks can be in the thousands and the number of networks can be in the tens.
- Fig. 2 is a schematic block diagram of a system 50 for generating service designs.
- a designer module 60 receives customer requests 70 that will relate to a request for a new network service, for a rearranged network service or for the termination of a network service.
- the designer module 60 also receives as inputs technology rules 80 and policy/business rules 90. Additionally, a detailed network inventory 100 is available to the designer module 60.
- a limited, abstracted form of the total network inventory 100 is stored locally in a local network inventory 110.
- the designer module 60 takes into account the technology rules 80 policy/business rules 90 and the local network inventory 110 information, and generates a service design 120 as the output.
- the service design 120 represents a plan of how to configure services in the network in the satisfaction to the customer requests.
- Fig. 3 is a block flow diagram 150 describing, in broad terms, how the customer requests 70 are handled to generate the resultant service design 120.
- a customer request is received and the appropriate Design Model for the customer request is selected.
- all the design permutations for the selected Design Model are determined.
- each design permutation is compared against a local network model, and one permutation is chosen to generate the service design 120.
- the network inventory 100 holds data describing the network 10.
- the designer module 60 requests the following data from the inventory 100:
- a set of Product Models 200 are developed by applying a set of given business rules 90 to a library of design criteria 210.
- the criteria include lists of network element types, trail types, termination point types, and so on.
- the Design Product is an abstraction of the standard form(s) of a trail for a given purpose.
- Each Design Product may have several Design Models, which represent alternative ways to compose the trail.
- Each Design Model consists of a set of Design Items.
- a Design Item is a set of selection criteria for finding an appropriate network resource, and can also be thought of as a placeholder that will become a component in the resulting service design.
- a Design Item may encapsulate another Design Product, allowing different alternatives to be considered for subsections of the overall design.
- Fig. 5 shows an example Product Model 220.
- the legend 222 shows the relationship between a Design Product, a Design Model and a Design Item. Unless otherwise mentioned, each Design Item allows only one repeat.
- the example Product Model 220 builds an El (2 Mbit/s) trail between two given nodes. There are four Design Products: the El Circuit 224, the A End Access 226, the Inter- Exchange Network 228 and the Z End Access 230.
- the El Circuit 224 Design Product holds two Design Models: Single Exchange 232 and Inter-Exchange 234. Within the Single Exchange model 232, there are three Design Items: Product A End Access 236, Physical Cross-Connect 'X' 238 and Product Z End Access 240. Within the hiter-Exchange (Reversible) model 234 are four Design Items: Product A End Access 242, Physical Cross-Connect 'X" 244, Product Inter-Exchange 0 Network 246 and Product Z End Access 248.
- the A End Access Design Product 226 holds three Design Models: Co-located 250, SDH 252, PDH 254 and PDH + SDH 256.
- the respective Design Items are: Transport SDH 'S' 258, Transport PDH 'P' 260, Transport PDH 'P' 262 and Transport PDH 'S' 264. 5
- the Z End Access Design Product 230 has matching Design Products 266-272, and Design Items 274-280.
- the Inter-Exchange Network Design Product 238 has two Design Models: ATM 282 and 0 SDH 284, within each respectively is a single Design Item: Transport ATM 'A' 286 and SDH 288.
- the latter design item SDH allows up to three repeats.
- the Design Product A End Access 226 has an association with the two Design Items Product A End Access 236, 242.
- the Design Product Inter- Exchange Network 238 has an association with the Design Item Product Inter-Exchange Network 246, and the Design Product Z End Access 230 has associations with the Design Items Product Z End Access 240, 248.
- the example business rules 90 embodied in this Design Product 220 are as follows:
- Trail must pass through at least one cross-connect NE, for law enforcement monitoring
- the following tables show an example of the local network inventory 110.
- a block flow diagram 300 describes an embodiment of producing a service design for a telecommunications network structure.
- the customer request 70 is considered, and with reference to the Product Models 200, the relevant subset of such Models is chosen.
- the permutations of Design Items for each chosen relevant Product Model are determined. Where Design Products are nested, then the permutations of the outer Design Product represent the "most significant" variable in the permutations. Where permutations are not nested but instead are "side by side” within a Design Model, the permutations are evaluated in a ranking order to ensure that the most preferable permutations are evaluated first, hi this situation a permutation can be considered as a vector [pi p 2 p 3 ...] of the indices of the options available for each decision point.
- the order in which the permutations are evaluated is determined by an attribute "explode sequence" of each decision point (e.g., the choice of Design Models within a Design Product).
- the explode sequences can also be represented as a vector [ei e 2 e 3 ...] with the same number of elements as the permutations themselves.
- any two permutations [X 1 X 2 X 3 ...] and [y 1 y 2 y 3 ...] can be ranked by the rule that x is preferable to y if x n ⁇ y n for the value of n with the lowest possible value of C n where X n ⁇ y n .
- This is analogous to a motor vehicle's odometer, with the decision point having the lowest explode sequence representing the most significant digit on the odometer.
- each permutation consists of a list of Design Items. (In this list, each letter represents a Design Item.)
- the explode sequence for the "A End Access” and "Z End Access” Design Products is 1 for both, and the explode sequence for the repeats of the 'M' design item (i.e. SDH 284 within the Inter-Exchange Network Design Model 228) is 2.
- the permutations need to be ranked by f(p, 1) and f(p, 2) where it exists (i.e. the permutations include the design item with explode sequence 2).
- each permutation for each relevant Product Model is compared against the local network inventory 110 to find a trail between the required start and end nodes that consists of network infrastructure that matches the Design Items in the permutation.
- Steps that would take the design further away from the core of the network are eliminated by the use of business rules 90 known as "hubbing rules".
- Nodes are categorised as to their level of importance in the carrier's network, and there are restrictions about how the levels can be traversed at each step. In general, it is illegal to take a step from a higher level node to a lower level node.
- the nodes in the example network are categorised as Periphery, Local Exchange and Main Exchange. Hubbing rales in this example only allow the following steps:
- Periphery ⁇ Periphery, Local Exchange or Main Exchange
- the decision of which end to concentrate on at any given step is also determined by the relative hubbing level of the nodes. It is preferred to try to 'path' from the lower level node at each step.
- the algorithm chooses which end to start from based on the hubbing level and possibly other heuristics (which might affect the efficiency of the algorithm but
- NodeF NodeF
- NodeH NodeJ
- NodeJ can be eliminated because it represents a step from a Local Exchange node to a Periphery node, which is disallowed by the hubbing o table. The two remaining options will then be evaluated in turn via the steps below.
- NodeH is evaluated first. This time the algorithm decides to start from the A end of the permutation, i.e. find SDH transport from NodeB. There is no SDH s transport that goes directly from NodeB to NodeH, so because this was the only remaining transport item left in the permutation, this attempt fails.
- NodeF is evaluated next. Again, starting from the A end of the permutation, we find an SDH transport that connects NodeB with NodeF.
- Validation s At block 340, the particular permutation of the product model resulting from the comparison process of block 330 is then validated against the local network inventory 110.
- This validation primarily consists of finding suitable capacity in the network o infrastructure identified.
- suitable timeslots must be found in the two SDH subnetworks, and suitable termination points need to be found on the cross-connect network element.
- the choice of resources must also conform to technology rules 80 - for example, the cross-connections between timeslots and termination points that are possible within a given network element type.
- the service design plan 120 is constructed using the infrastructure objects identified and the capacity that is to be consumed across that infrastructure (eg. the timeslots and termination points). That capacity is reserved in the network inventory 100 to ensure it is not taken by a subsequent design.
- Fig. 7 shows a schematic block diagram of a computer system 400 that can be used to practice the methods described herein. More specifically, the computer system 400 is provided for executing computer software that is programmed to produce service designs for a communications network in response to a provisioning order. The computer software executes under an operating system such as MS Windows 2000, MS Windows XPTM or LinuxTM installed on the computer system 400.
- an operating system such as MS Windows 2000, MS Windows XPTM or LinuxTM installed on the computer system 400.
- the computer software involves a set of programmed logic instructions that may be executed by the computer system 400 for instructing the computer system 400 to perform predetermined functions specified by those instructions.
- the computer software may be expressed or recorded in any language, code or notation that comprises a set of instructions intended to cause a compatible information processing system to perform particular functions, either directly or after conversion to another language, code or notation.
- the computer software program comprises statements in a computer language.
- the computer program may be processed using a compiler into a binary format suitable for execution by the operating system.
- the computer program is programmed in a manner that involves various software components, or code, that perform particular steps of the methods described hereinbefore.
- the components of the computer system 400 comprise: a computer 420, input devices 410, 415 and a video display 490.
- the computer 420 comprises: a processing unit 440, a memory unit 450, an input/output (I/O) interface 460, a communications interface 465, a video interface 445, and a storage device 455.
- the computer 420 may comprise more than one of any of the foregoing units, interfaces, and devices.
- the processing unit 440 may comprise one or more processors that execute the operating system and the computer software executing under the operating system.
- the memory unit 450 may comprise random access memory (RAM), read-only memory (ROM), flash memory and/or any other type of memory known in the art for use under direction of the processing unit 440.
- the video interface 445 is connected to the video display 490 and provides video signals for display on the video display 490.
- User input to operate the computer 420 is provided via the input devices 410 and 415, comprising a keyboard and a mouse, respectively.
- the storage device 455 may comprise a disk drive or any other suitable non-volatile storage medium.
- Each of the components of the computer 420 is connected to a bus 430 that comprises data, address, and control buses, to allow the components to communicate with each other via the bus 430.
- the computer system 400 may be connected to one or more other similar computers via the communications interface 465 using a communication channel 485 to a network 480, represented as the Internet.
- the computer software program may be provided as a computer program product, and recorded on a portable storage medium. In this case, the computer software program is accessible by the computer system 400 from the storage device 455. Alternatively, the computer software may be accessible directly from the network 480 by the computer 420. In either case, a user can interact with the computer system 400 using the keyboard 410 and mouse 415 to operate the programmed computer software executing on the computer 420.
- the computer system 400 has been described for illustrative purposes. Accordingly, the foregoing description relates to an example of a particular type of computer system such as a personal computer (PC), which is suitable for practicing the methods and computer program products described hereinbefore. Those skilled in the computer programming arts would readily appreciate that alternative configurations or types of computer systems may be used to practice the methods and computer program products described hereinbefore.
- PC personal computer
Abstract
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
AU2005339252A AU2005339252A1 (en) | 2005-12-21 | 2005-12-21 | Service designs for communications networks |
PCT/AU2005/001943 WO2007070914A1 (en) | 2005-12-21 | 2005-12-21 | Service designs for communications networks |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/AU2005/001943 WO2007070914A1 (en) | 2005-12-21 | 2005-12-21 | Service designs for communications networks |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2007070914A1 true WO2007070914A1 (en) | 2007-06-28 |
Family
ID=38188123
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/AU2005/001943 WO2007070914A1 (en) | 2005-12-21 | 2005-12-21 | Service designs for communications networks |
Country Status (2)
Country | Link |
---|---|
AU (1) | AU2005339252A1 (en) |
WO (1) | WO2007070914A1 (en) |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5821937A (en) * | 1996-02-23 | 1998-10-13 | Netsuite Development, L.P. | Computer method for updating a network design |
US5953389A (en) * | 1993-11-16 | 1999-09-14 | Bell Atlantic Network Services, Inc. | Combination system for provisioning and maintaining telephone network facilities in a public switched telephone network |
US6330586B1 (en) * | 1995-02-07 | 2001-12-11 | British Telecommunications Public Limited Company | Reconfigurable service provision via a communication network |
WO2002027564A1 (en) * | 2000-09-25 | 2002-04-04 | Wireless Valley Communications, Inc. | System and method for design, tracking, measurement, prediction and optimization of data communications networks |
GB2403623A (en) * | 2003-05-24 | 2005-01-05 | Univ Strathclyde | Management and control of telecommunication services delivery |
-
2005
- 2005-12-21 AU AU2005339252A patent/AU2005339252A1/en not_active Abandoned
- 2005-12-21 WO PCT/AU2005/001943 patent/WO2007070914A1/en active Application Filing
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5953389A (en) * | 1993-11-16 | 1999-09-14 | Bell Atlantic Network Services, Inc. | Combination system for provisioning and maintaining telephone network facilities in a public switched telephone network |
US6330586B1 (en) * | 1995-02-07 | 2001-12-11 | British Telecommunications Public Limited Company | Reconfigurable service provision via a communication network |
US5821937A (en) * | 1996-02-23 | 1998-10-13 | Netsuite Development, L.P. | Computer method for updating a network design |
WO2002027564A1 (en) * | 2000-09-25 | 2002-04-04 | Wireless Valley Communications, Inc. | System and method for design, tracking, measurement, prediction and optimization of data communications networks |
GB2403623A (en) * | 2003-05-24 | 2005-01-05 | Univ Strathclyde | Management and control of telecommunication services delivery |
Also Published As
Publication number | Publication date |
---|---|
AU2005339252A1 (en) | 2007-06-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11303565B2 (en) | Traffic matrix prediction and fast reroute path computation in packet networks | |
US10033623B2 (en) | Multithreaded system and method for establishing network connections | |
US20090296719A1 (en) | Method for Configuring an Optical Network | |
EP1993223B1 (en) | Method and device of group broadcast protection in wdm optical network | |
JP2004208297A (en) | System and method for rapid selection of device in tree topology network | |
US6711324B1 (en) | Software model for optical communication networks | |
US20150043911A1 (en) | Network Depth Limited Network Followed by Compute Load Balancing Procedure for Embedding Cloud Services in Software-Defined Flexible-Grid Optical Transport Networks | |
US7152113B2 (en) | Efficient system and method of node and link insertion for deadlock-free routing on arbitrary topologies | |
US20190028201A1 (en) | Multi-layer virtual network embedding | |
Fortz et al. | A tabu search algorithm for self-healing ring network design | |
CN103795641A (en) | Optical network resource management method based on multi-dimensional frame mapping | |
KR100271856B1 (en) | Optimal path selective routing method | |
US20070140144A1 (en) | Service designs for communications networks | |
WO2007070914A1 (en) | Service designs for communications networks | |
Katib et al. | Adaptive alternate routing in WDM networks and its performance tradeoffs in the presence of wavelength converters | |
Skorin-Kapov et al. | On minimum congestion routing in rearrangeable multihop lightwave networks | |
US7349351B2 (en) | Method for determining a master ring for an optical communications network | |
JPH07143062A (en) | Optical path storage method and optical communication network | |
Pages et al. | Orchestrating virtual slices in data centre infrastructures with optical DCN | |
CN108768863B (en) | Transmission network route analysis method and device and computer readable storage medium | |
Barry et al. | Evaluation of a model of blocking probability in all-optical mesh networks without wavelength changers | |
Allen et al. | An incremental procedure for improving path assignment in a telecommunications network | |
EP3148117B1 (en) | System and method for discovering the locations of potential layer-2 nodes in a telecommunications network | |
WO2023065852A1 (en) | Service deployment method and related device | |
EP1449320A1 (en) | Method for planning or provisioning data transport networks |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
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: 2005339252 Country of ref document: AU |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
ENP | Entry into the national phase |
Ref document number: 2005339252 Country of ref document: AU Date of ref document: 20051221 Kind code of ref document: A |
|
WWP | Wipo information: published in national office |
Ref document number: 2005339252 Country of ref document: AU |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 05818501 Country of ref document: EP Kind code of ref document: A1 |