EP0926860B1 - Verkehrswegesucher in einem Kommunikationsnetz - Google Patents

Verkehrswegesucher in einem Kommunikationsnetz Download PDF

Info

Publication number
EP0926860B1
EP0926860B1 EP98309749A EP98309749A EP0926860B1 EP 0926860 B1 EP0926860 B1 EP 0926860B1 EP 98309749 A EP98309749 A EP 98309749A EP 98309749 A EP98309749 A EP 98309749A EP 0926860 B1 EP0926860 B1 EP 0926860B1
Authority
EP
European Patent Office
Prior art keywords
data
network
route
node
link
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
EP98309749A
Other languages
English (en)
French (fr)
Other versions
EP0926860A2 (de
EP0926860A3 (de
Inventor
Jason Warren Mann
Anthony Richard Phillip White
John Ian Turner
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nortel Networks Ltd
Original Assignee
Nortel Networks Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nortel Networks Ltd filed Critical Nortel Networks Ltd
Publication of EP0926860A2 publication Critical patent/EP0926860A2/de
Publication of EP0926860A3 publication Critical patent/EP0926860A3/de
Application granted granted Critical
Publication of EP0926860B1 publication Critical patent/EP0926860B1/de
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/24—Multipath
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J2203/00—Aspects of optical multiplex systems other than those covered by H04J14/05 and H04J14/07
    • H04J2203/0001—Provisions for broadband connections in integrated services digital network using frames of the Optical Transport Network [OTN] or using synchronous transfer mode [STM], e.g. SONET, SDH
    • H04J2203/0051—Network Node Interface, e.g. tandem connections, transit switching
    • H04J2203/0053—Routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J2203/00—Aspects of optical multiplex systems other than those covered by H04J14/05 and H04J14/07
    • H04J2203/0001—Provisions for broadband connections in integrated services digital network using frames of the Optical Transport Network [OTN] or using synchronous transfer mode [STM], e.g. SONET, SDH
    • H04J2203/0064—Admission Control
    • H04J2203/0067—Resource management and allocation
    • H04J2203/0069—Channel allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5619—Network Node Interface, e.g. tandem connections, transit switching
    • H04L2012/562—Routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/564—Connection-oriented
    • H04L2012/5642—Multicast/broadcast/point-multipoint, e.g. VOD
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5651—Priority, marking, classes

Definitions

  • the present invention relates to a method of finding routes for connections across a communications networks comprising a plurality of node elements connected by a plurality of link elements, and particularly although not exclusively to a method of finding an optimized routing for a plurality of point to multipoint connections.
  • a conventional broadband circuit switched communications network for example a telephony network or a mobile phone network, comprises a plurality of nodes, at which are provided node equipment, the nodes connected by a plurality of communications links, the links comprising link equipment.
  • the node equipment may comprise, for example a telecommunications switch apparatus, and the links may comprise a terrestrial link, eg an optical fiber link or coaxial cable or a wireless link.
  • An increasing range of services are delivered over such networks, including as examples, video on demand, video conferencing, distance leaming, and intemet services.
  • Such services involve delivering different traffic data types, eg voice traffic, video or computer data traffic, having different characteristics, some types of traffic being more sensitive to delay than others and the different traffic types having different ranges of bitrate requirements.
  • These services may involve delivery of data from a single source to a single destination (point to point) from a single source to many destinations (point to multipoint) or from a plurality of sources to a plurality of destinations (multipoint to multipoint).
  • Such services place heavy requirements for routing of connections supporting these services over a network.
  • WO 96/31969 there is disclosed a method of routing traffic from a communications network which uses a genetic algorithm search routine to find optimum sets of paths between nodes in a network for routing of traffic on a point to point connection basis with the object of minimizing a number of communications channels used, and to reduce a risk of a communications system being unable to handle a high volume of traffic.
  • a set of shortest paths forms the basis for an initial string population of the genetic algorithm.
  • Routes are selected according to a fitness criteria which includes a user specified weighting based on a number of channels required to support traffic, utilization of links represented as a number of links whose capacity could be exceeded, and a user specified "path cost" comprising a sum of costs of a plurality of links of a path between nodes.
  • the user can vary the fitness criteria by altering the respective weighting given to the path cost, utilization, and number of channels in order to customize the genetic algorithm process to select for these criteria according to an importance as reflected in the user specified weightings.
  • shortest path routing even as optimized by genetic algorithm technique, cannot provide solutions for point to multipoint routing. Further, shortest path routing cannot deal with service requests for mixed traffic data types.
  • a publication entitled "A New Approach to the Degree-Constrained Minimum Spanning Tree Problem Using Genetic Algorithm" having publication reference XP10206541 discloses a method of finding routes of links for a plurality of communications connections over a network comprising a plurality of node elements and link elements, each said connection having a source node element and a plurality of destination node elements, said method comprising the machine executable steps of: assigning at least one link cost to each said link element; for each said connection to be routed, evaluating a route cost of traversing a plurality of link elements between said source node element and said plurality of destination node elements; and for all said connections to be routed, evaluating a total cost of said route costs.
  • Users of services delivered over such a communications network may make requests for services to be carried over the network, specifying a plurality of connections each between a source node and one or more destination nodes.
  • Such service requests do not usually specify a route of nodes and links in the network which should be taken between the source and destination nodes.
  • One object of the present invention is to find routes for connections specified in a service request in a manner which takes into account a plurality of service requests simultaneously rather than one service request at a time.
  • Another object is to balance routing of connections across the network. For instance, if two connections would ideally include a same link in a shortest path, but this could result in either that link becoming overloaded or one of the connections needing to take a much longer route, then it may be beneficial for one or both of the connections to be routed over slightly longer routes in order to avoid network congestion, thereby resulting in a more even distribution of network link and node utilization.
  • Another object of the present invention is to provide a capability to include or exclude certain nodes or links from routes found for a particular connection, for example if it is known that a particular network node equipment is not working properly or for security reasons.
  • a further object is to provide a generic route finding means which is reusable for circuit switched communications networks using different transport protocol types.
  • the generic route finder means takes a modularized embodiment capable of being installed in a network controller or network manager, and acting as a server for a plurality of other network management applications.
  • a further object of the present invention is to route connections in a communications network according to a type of traffic which is to be carried.
  • a further object of the present invention is to distribute traffic of a service connection over a plurality of routes.
  • a further object of the present invention is to distribute point to multi-point traffic over a network.
  • a method in accordance with a first aspect of the present invention is characterized over publication XP10206541 in that, for each said connection to be routed, it includes the steps of: selecting a set of node elements of said network which are not included in a source node element or a plurality of destination node elements of said connection; and determining which of said node elements in said set are Steiner Vertices.
  • said set of node elements is represented by a string of bits, a bit in said string having a value of 1 if said node element it represents is marked as a Steiner Vertex, and a bit in said string having a value of 0 if said node element it represents is not marked as a Steiner Vertex.
  • said step of evaluating a route cost comprises the steps of:
  • said string of bits is manipulated using genetic algorithm operations, including reproduction, mutation, crossover and merging.
  • Said cost(s) assigned to said link element are associated with a data type, and said method may comprise the step of assigning a data type to all or some of said connections to be routed.
  • a route finder apparatus comprising means for implementing the method in accordance with the first aspect of the invention.
  • a network controller including the route finder apparatus in accordance with the second aspect of the invention.
  • a telecommunications network including a network controller in accordance with the third aspect of the invention.
  • a machine readable medium comprising computer code means executable on a processor of the network controller in accordance with the third aspect of the invention for implementing the method in accordance with the first aspect of the invention.
  • Methods for routing of connections according to the present invention may have application in network design. Simulating a number of connections can identify any unnecessary links in the network, eg links which are used lightly or not at all. Important links in the network may also be identified by applying conventional routing algorithms and techniques, for example heavily loaded links or links which are potential bottlenecks.
  • a circuit switched communications network comprising a plurality of node elements 101 each comprising an item of node equipment for example a switch, and a plurality of link elements 102, connecting the node elements, each link element 102 comprising an item of link equipment, eg terrestrial or wireless communication links.
  • Each item of node equipment may comprise a plurality of individual physical components.
  • Each item of link equipment may comprise one or a plurality of physical components.
  • Each link equipment may support a plurality of communication channels.
  • a "link” is characterized as being a communications path between two nodes, with no intervening nodes.
  • the communications network may include mobile phone communications apparatus resident at one or more nodes of the network and a node element may comprise a gateway to another network, for example a world wide web gateway.
  • the communications network will comprise a variety of different types of node equipment and a variety of different types of link equipment, made by different manufacturers and having differing performance specifications.
  • traffic data signals are transmitted along the link equipment and through the node equipment over a circuit switched path between a source node element and a destination node element. The traffic data is carried between sources and destinations over a plurality of routes across the network.
  • a network controller 104 may be attached to a node equipment 101, the network controller comprising management functionality for managing routes or connections across the network.
  • the network controller comprises a modular route finder component which acts as a server for finding routes for connections in response to service requests generated by a plurality of different network management applications.
  • the route finder component may support other network management applications resident on the network controller, for example the route finder component may support network topology design for Synchronous Digital Hierarchy (SDH)/Synchronous Optical NETwork (SONET) rings, or network design and bandwidth provisioning.
  • SDH Synchronous Digital Hierarchy
  • SONET Synchronous Optical NETwork
  • Fig. 2 of the accompanying drawings illustrates a schematic diagram of one embodiment of a network controller 104.
  • the network controller comprises a general purpose computer, such as a Hewlett Packard 9000 series work station, comprising a memory 201; a processor 202; an operating system 203; a plurality of communications ports 204 through which data is transferred to and from communications node equipment hardware 205; a management information base (MIB) 206 holding data describing physical resources of a network, eg node equipment type, link bitrate capacity; route finder component 207 for routing service requests across the network, the route finder component comprising a route finder manager 208 and a route finder engine 209, the route finder manager comprising one or a plurality of pre-processing components for pre-processing data prior to input to the route finder engine 209, and one or a plurality or post-processors for processing data after output from the route finder engine; a plurality of network management applications 210 for managing services over the networks, and
  • ATM Asynchronous Transfer Mode
  • SDH Synchronous Digital Hierarchy
  • the route finder component 207 may not provide a real time routing mechanism, but operates to develop and optimize routing strategies across the network in response to a plurality of service requests generated by the other network service applications 210.
  • the routing strategies produced by the route finder component 207 are used to produce routing tables for use by conventional real time routing applications within the network.
  • Fig. 3 illustrates an example of a generic representation of a communications network, eg as illustrated in Fig. 1.
  • the generic network representation is viewed as a topology graph comprising a plurality of nodes 301 connected by a plurality of links 302.
  • Any node element equipment 101 can be represented by a node 301.
  • Any link equipment 102 can be represented by a link 302 between two nodes.
  • the links can be uni-directional or bi-directional, depending on whether messages can be transmitted across the link in one or two directions respectively at any given time.
  • Each node and link has a pre-determined finite bitrate transmission capacity.
  • Network service applications running on the network controller or other workstations connected to the network may make a number of service requests which need to be implemented as connections between particular nodes.
  • a service request can give rise to one or a plurality of connection requests.
  • Each connection request results in requests for source to destination connections which must be routed across the network, in order to carry data traffic comprising the requested service.
  • the service requests may specify the type of data traffic to be transferred, eg data or voice, a source node and one or more destination nodes.
  • connection means a circuit switched allocation of physical resources between a source node and one or more destination nodes.
  • point to multipoint connection means a circuit switched connection between a source node and a plurality of destination nodes, and the term “point to multipoint” is to be construed accordingly.
  • multipoint to multipoint connection means a circuit switched connection between a plurality of source nodes and a plurality of destination nodes, and the term “multipoint to multipoint” shall be construed accordingly.
  • a "route” comprises a path across one or a plurality of links, between a source node and at least one destination node.
  • a route may comprise a collection of links used for multipoint connection requests (a "tree").
  • a path comprises a collection of links from a single source node to a single destination node.
  • a tree comprises a connection of links between multiple sources and/or multiple destinations.
  • a "route” can be either a path or a tree, depending upon the connection request. In either case, the route comprises a collection of links.
  • a single connection may take one or a plurality of routes.
  • service requests are received by the route finder component 207 which can assign routes to requested connections according to specific criteria such as avoiding overloading any specified link or node or attempting to utilize as many nodes/links in the network as possible at a given time.
  • Each link is assigned an associated cost, denoted by numerals C1 - C12 near the center of the link lines 302 in the general topology view of Fig. 3.
  • Assignment of costs to links for a network is user specifiable. All costs can be uniform through the network or complex costs can be attached to links, for example relating to link utilization by connections. The costs can also be variable for different traffic types, for example resulting from voice or data connections.
  • the route finder component operates to find routes having the minimum overall costs for connections to be routed between nodes in the network and thereby find routes which for example experience lower delay, or have faster, more reliable transmission.
  • Fig. 4 of the accompanying drawings illustrates a schematic diagram of a high level architecture of the route finder component 207 and associated input and output data operated on by the route finder component.
  • the route finder engine 209 preferably comprises a memory, and a processor executing one or more route finding algorithms.
  • the route finder manager 208 comprises a service request pre-processor 400; a network data pre-processor 401; an evaluation function processor 402; and a route data post-processor 303.
  • Each of the service request pre-processor, network data pre-processor, evaluation function processor and route data post-processor may comprise a processor element and an area of data storage device configured by means of algorithms for carrying out data traffic pre-processing, network data pre-processing, evaluation functions and route data post-processing respectively.
  • Extemal network management applications including service management applications send service requests to the route finder manager 208 and the route finder manager responds by retuming a routing strategy for implementing those services.
  • the routing strategy is produced in the form of routing table data 410 describing a plurality of routes assigned to a plurality of connections.
  • the route finder engine 209 receives input data from service request pre-processor 400, network data pre-processor 401 and evaluation function processor 402, and outputs data to route data post-processor 403.
  • the pre-processors 400, 401 and 402 are configured to convert data from extemal management applications into a generic form suitable for input into route finder engine 209.
  • the route finder engine can also transfer data to and from a graphical user interface (GUI) 211 allowing an operator to obtain a visual display view of connections and routes taken by connections which are assigned or to be assigned by the route finder engine 209.
  • GUI graphical user interface
  • the service request pre-processor and network data pre-processor input service request data, network topology data and switch definition data in an implementation specific format and convert this data into a format which is generic and not specific to any proprietary equipment types or transport protocols.
  • the route finder engine 209 operates on the generic data produced by the pre-processors to produce generic output data, which is operated on by route data post-processor 403 prior to storing on the MIB.
  • the service request pre-processor, network data pre-processor and route data post-processor are implemented as product specific components, that is to say, are configured to a type of node equipment, eg switch, MIB etc which is proprietary, and may be customized in each installation.
  • the route finder engine 401 and evaluation processor 404 are generic and re-usable from installation to installation.
  • the service requests 407, network topology data 408, switch definition data 412, routing objective data 409, routing tables 410 and routing statistics 411 may be stored on management information base 206 and are accessible to a plurality of other network management applications resident on the network controller, or elsewhere on the network.
  • Data stored on the management information base may be specific to particular proprietary network elements, and may be specific to particular transport mechanisms, eg ATM, SDH, SONET.
  • Service request pre-processor 400 receives input service request data in the from of a list of service requests 407 from an extemal application.
  • a service request may specify:
  • the service request pre-processor 400 converts the service requests 407 into a generic data format suitable for input to the route finder engine 209.
  • the input service request data 407 may be specific to individual switch types, or transport protocol types.
  • Service request pre-processor 400 converts the service request data to produce a traffic matrix data for each traffic type. These matrices are transformed into generic service requests by service request pre-processor 400, which are input into route finder component 207 to be routed across the network.
  • the network data pre-processor 401 receives input data describing the network 408 from Management Information Base 206.
  • the network data describes connectivity and topology of nodes and links of the network.
  • the network data may contain switch definition data 412 which describes network node elements' characteristics such as bandwidth capacity.
  • the network topology data may include:
  • the network data pre-processor 403 converts the input network data into a generic form suitable for the route finder component 207.
  • Network data pre-processor 403 receives the network data 408 including switch definition data 412, which may be in a form specific to individual proprietary switches and link equipment, and generates generic network graph data which is input into route finder generic engine 209. Since the network data 408 includes switch specific information, such switch specific information is converted to generic format by network data pre-processor 401.
  • An example of a switch specific information is a bitrate capacity of a switch.
  • Evaluation function processor 402 receives a representation of routing objectives data 409 entered by a user.
  • the evaluation function processor 402 is used by the route finder engine's genetic algorithms to quantify efficiency/fitness of a particular set of routes found for the service requests it receives.
  • Evaluation function pre-processor 402 receives routing objective data 409 describing high level routing objectives specified by a network operator. Such high level routing objectives may comprise data describing constraints on routing.
  • the evaluation function pre-processor 402 assigns a fitness data to potential routing strategies specified in the routing objective data 409. The assigned fitnesses are used by the route finder engine in searching for potential routes across the network.
  • the route finder engine 209 produces route data describing a list of routes for the service requests.
  • the output route data is transferred to route data post-processor 403 which converts the route data into a routing table 410.
  • the route finder engine 209 produces route data in generic format for each node in the network.
  • the route data post processor 403 converts the generic format route data into a product specific routing table form usable by the network switches.
  • the routing table data is accessible by a connection control component of the node equipment switches for implementing the connections.
  • the route finder engine 209 also outputs routing statistics data 411. A user can view and evaluate the routes found by the route finding component by inspection of the routing statistics data 411 stored on the MIB 206.
  • Routing statistics data 411 may include data describing
  • the route finder engine 209 is configured to operate on generic network data produced by the service request pre-processor 400, network data pre-processor 401, and evaluation function processor 402.
  • the route finder engine 209 operates according to an algorithm which performs an artificial intelligence search technique.
  • the route finder engine operates a genetic algorithm, although as an altemative, a simulated annealing algorithm, or a combination of a genetic algorithm and a simulated annealing algorithm may be applied by the search engine.
  • the search algorithms of the route finder engine component can operate without using any problem specific knowledge.
  • the search algorithm optimizes its search for routes according to fitness data produced by evaluation function processor 402.
  • evaluation function processor 402. By separating the search engine from the evaluation criteria produced by evaluation function processor 402, modularization and generality may be achieved, thereby allowing improvements to be made to the search algorithm independently of service request pre-processor 400, network data pre-processor 403, or evaluation function processor 402.
  • Fig. 5 herein illustrates schematically route finder component 207 and examples of interactions with a network management application 500.
  • the network management application 500 communicates with the route finder component 207 by a series of set, get and command signals (set request, set response, get request, get response, command request, command response) as illustrated in Fig. 5.
  • Network data is passed from the management application to the route finder component, enabling the route finder component to gain knowledge of the network across which the network management application requests to deploy a service.
  • the route finder component 207 finds an optimized set of routes for carrying the service, and retums data describing those routes to the management application 500 in the form of routing table data 410.
  • the route finder component 207 determines the optimum routes in accordance with a set of default parameters.
  • the default parameters are stored in the route finder component 207 and the management application 500 or a user may update, query or change the default parameters by means of the command request signals.
  • route finder component 207 a genetic algorithm implementation of route finder component 207 will be described. It will be understood that in other embodiments of the invention, the genetic algorithm search engine may be replaced by other artificial intelligence technique search engines, for example a simulated annealing search engine, or a combination of a genetic algorithm search engine and a simulated annealing search engine.
  • the genetic algorithm search engine may be replaced by other artificial intelligence technique search engines, for example a simulated annealing search engine, or a combination of a genetic algorithm search engine and a simulated annealing search engine.
  • the route finder component 207 comprises a plurality of data processing elements, each comprising a processor and an associated area of memory device carrying out specific processes as illustrated schematically in Fig. 6. Data is transferred between processors as indicated in Fig. 6 herein.
  • the symbol * associated with several of the processes in Fig. 6 indicates that there is a data flow from control parameters data 612 to shortest path calculation process 603, initial population generation process 604, route generation process 605, genetic manipulation process 606, population reproduction process 607, merge population process 608, fitness evaluation process 402, and Steiner Tree production process 610.
  • the functions of each of the process are as follows.
  • Engine control processor 600 controls invocation of all other processes within the route finder generic engine 209.
  • Profile generation process 601 reads a data file containing data describing network topology and traffic demand information and processes it into an intemal representation of the network and of traffic demands, both point to point and point to multipoint, placed upon the network by an application.
  • a network data file output from network data pre-processor 401 is input into profile generator process 601.
  • Control parameter data 611 describing parameters such as form example weighting coefficients associated with a fitness evaluation process 609 carried out by evaluation function processor 402 is also input into profile generation process 601.
  • Representation generation process 602 operates on traffic demand representation data 612, network representation data 613 output from profile generation process 601 and selected control parameter data 611 to compute a number of bits which are required by the genetic algorithm to represent a routing decision space, from which generic routing solutions will be found.
  • Network representation data 613 stores two "views" of the network. Firstly, a graph view of the network on which algorithms, eg k shortest path algorithm or minimum spanning tree algorithms can be run is stored in the network representation data 613. Secondly, a view of the network which allows a mapping to extemal node and link names is stored. This view is generated during network data parsing, and is used principally during production of routes.
  • the information stored for the network representation data 613 includes:
  • Link cost information is stored for all traffic types in the traffic demands which require routing.
  • Shortest path calculation process 603 operates a known Yen-Lawler algorithm on the network representation data 613 and traffic demand representation data 612 and outputs the shortest path data 616 comprising an integer number k shortest paths for each service request 407 input to the route finder component 207.
  • a genetic algorithm search routine is implemented by initial population generation processor 604, genetic manipulation processor 606, population reproduction processor 607, merge population processor 608, and fitness evaluation processor 609.
  • genetic algorithm processes are well known in the prior art and involve representing a problem as a series of bits or bytes of data in fixed length bit strings. Populations of fixed length bit strings are altered, combined, mutated and crossed over with each other and optimized bit strings are selected in accordance with a fitness criteria.
  • routes across a network of nodes and links are represented by bit strings of ones and zeros, which are mutated and combined to find optimum routes in accordance with routing objectives 409 input into a fitness evaluation function operated by evaluation function processor 402.
  • Initial population generation processor 604 operating part of the genetic algorithm, computes a size of a routing decision space from which routes are to be found and produces an initial population of string data representing routes across the network.
  • size of a decision space it is meant a number of possible different routes (each represented by a corresponding respective string).
  • the strings in the initial population describe randomly assigned routes across the network.
  • an initial string population in which all shortest paths across the network have been assigned may be generated.
  • initial population generation process 604 inputs representation definition data 614 generated by representation generation process 602, and operates in accordance with various control parameters specified in the control parameter data 611.
  • a current population of strings represented by current population data 615 is input into population reproduction process 607.
  • Population reproduction process 607 takes the current population and reproduces the population of strings based upon the values of several control parameters specified in control parameter data 611, and in proportion to a "fitness" of the individual strings of the population of strings, to produce an intermediate population of strings represented by intermediate population data 618.
  • the fitness criteria are specified in fitness data 619, which are input into population reproduction process 607.
  • Genetic manipulation process 606 inputs the intermediate population data comprising an intermediate population of strings, applies known mutation and cross over process and thereby generates a manipulated population of strings. This process mixes the strings contained in the intermediate population.
  • the current population, intermediate population and manipulated population are merged by merge population process 608, according to parameters specified in control parameter data 611 and according to fitness values of each member of the population as determined by fitness evaluation process 609 outputting fitness data 619.
  • the fitness evaluation process 609 inputs data strings comprising population members from the current, intermediate and manipulated population data, decodes them through the use of shortest path and Steiner Tree information, and simulates routing of traffic using the network representation data based on the current, intermediate and manipulated population members.
  • a fitness function is evaluated according to control parameters specified in control parameter data 611 as will be described hereinafter.
  • a fitness value for each population member is generated.
  • Steiner Tree production processor 610 inputs bit strings representing routes comprising a current population represented as current population data 615 and computes Steiner Trees for each individual string. This process decodes the individual bit strings comprising population members, which indicate which of the graph nodes are to be included in the Steiner Tree. Prim's algorithm is used in order to compute a minimum spanning tree for the graph nodes included in the Steiner tree for each string population member.
  • a known spanning tree comprises a subgraph of a connected graph. This subgraph is a tree and involves all the nodes of the graph.
  • a minimum spanning tree is a weighted spanning tree formed from a weighted graph such that the real numbers assigned to each edge when summed total not greater than the corresponding sum for any other spanning tree defined for the subgraph.
  • Route generation process 605 periodically, selects optimum population member strings from the current population, with a period which may be specified by user in control parameter data 611, and decodes the strings into routing information for point to point and point to multipoint service requests. This information is printed as text information and is available to a user via graphical user interface 211.
  • an external network management application 500 sends commands to the route finder component 207 such as get, set, execute or command, and arguments of these commands control execution of the route finder component 207.
  • the get and set commands allow general interaction with control parameter data 611 under control of engine control process 600.
  • the Command instruction causes the search engine to begin a search for optimal routes.
  • the genetic algorithm search engine interacts with the representation generation process 602 and shortest path calculation process 603 in order to
  • the representation generation process and shortest path calculation processor are pre-processing steps in the route selection process. Each time the management application 500 requests a set of new routing solutions, the representation generation process and shortest path calculation process are operated in an initialization phase prior to operation of the search for routes.
  • a current population of data strings generated by initial population generation process 604 is input as current population data 615 into fitness evaluation process 609.
  • Fitness evaluation process 609 generates fitness data 619 corresponding to the current population of strings.
  • the fitness data and current population data is used by the population reproduction process to generate an intermediate population of strings output as intermediate population data 618.
  • Each string of the intermediate population has its fitness evaluated by fitness evaluation process 609 resulting in fitness data 619 describing a fitness value for each string comprising the intermediate population of strings.
  • the manipulated population of strings represented by manipulated population data 617 has its fitness evaluated by fitness evaluation process 609 resulting in fitness data 619 representing a fitness of each string of the manipulated population.
  • Data describing the three populations of strings, ie the current population, intermediate population and manipulated population, along with fitness value data corresponding to each string of the current, intermediate and manipulated populations are input to the merge population process 608 which generates a new current population of strings represented by current population data 615 based upon selection of fittest strings from each of the current, intermediate and manipulated populations.
  • the cycle completes by route generation process 605 computing a plurality of routes based upon one or more fittest strings of the current population, and retuming these computed routes to network management application 500 as routing tables 400, after first converting the output route data to a form suitable for input to the management application 500 in route data post-processor 403.
  • Generation of new routes is conditional upon control parameters stored in control parameter data 611, specified by network management application 500.
  • the generation of new route data terminates when population reproduction processor 607 determines that a predetermined number of evaluations specified in the control parameters data 611 have been performed.
  • the route finder component 207 then waits for further commands from the network management application 500 before generating further route table data.
  • fitness evaluation process 609 uses shortest path data and Steiner Tree data to accord a fitness parameter to the string members of the populations. Whilst shortest path information is generated only once in response to a request for routing from the network management application 500, Steiner Tree data is generated for each member of each population. Thus, Steiner Tree production is invoked for a point to multipoint service request.
  • interfacing between the service request pre-processor 400, network data pre-processor 401, evaluation function pre-processor 402, route data post-processor 403 and route finder engine 209 is made by way of reading and writing data from a plurality of results data files, which are written in simple ASCII protocol.
  • Fig. 7 herein illustrates steps executed by the route finder component 207.
  • data describing service requests 407 is entered into service request pre-processor 400 which produces a Simple ASCII Protocol (SAP) file describing the service requests which is entered into the route finder engine 209.
  • SAP Simple ASCII Protocol
  • network topology data 408 is entered into network data pre-processor 401 which outputs a SAP file describing relationships between nodes and links in the network.
  • the SAP file is entered into the route finder engine 209.
  • a SAP text file containing data representing routing objectives 409 input by a user is entered into the route finder engine 209.
  • the route finder engine 209 preferably uses genetic algorithms to route the service requests it receives as input on the network described in its input according to the entered routing objective data 409 evaluation function.
  • the route finder engine 209 outputs a SAP file containing a list of routes for the connection requests.
  • the SAP file may be entered into the route data post-processor 405 at step 705 in order to convert the route data SAP file into a form suitable for use by the extemal application which made the service requests.
  • route finder component 207 A set of routing strategies carried out by route finder component 207 will now be described. To aid understanding the operations are described as operations on single node and link network graph representations as shown schematically Figs. 8 and 9 herein. It will be understood that the graphs shown and the routes selected are implemented as machine executable data processing operations on data representing nodes and links of a network.
  • Fig. 8 of the accompanying drawings illustrates the generic network graph of nodes and links illustrated in Fig. 3.
  • a grid of coordinates 803 is superimposed upon the network graph, such that each node is assigned a unique XY coordinate position.
  • Links between nodes are assigned associated costs, (denoted in Fig. 8 by numerals near the center of the link lines).
  • An example of a route chosen by the route finder for a connection between a source node 801, labeled n_1 and a destination node 802 labeled n_8 is indicated by links having directional arrows. Configured for shortest path routing, the route finder preferably finds minimum cost routes for a plurality of connections between such pairs of source and destination nodes in the network.
  • the route finder may be configured to "balance" connections across the network. Balancing the connections may be achieved by taking into account an integer number K shortest paths between the source and destination node of each connection, and selecting the shortest path for each connection which yields an even distribution of network node and link utilizations.
  • FIG. 8 herein illustrates a generic network graph of nodes and links illustrating how balancing of traffic across the network is achieved.
  • a shortest path routing would force traffic between source 801 node n_1 and destination 802 node n_7 and traffic between source S node n_1 and second destination node n_8 through nodes n_2 and n_6, placing congestion on nodes n_2 and n_6, by considering an integer number k shortest paths, traffic from source n_1 to first destination n_7 may be routed through altemative nodes n_3 and n_5, whilst traffic between source n_1 and second destination n_8 may continue to be routed through nodes n_2 and n_6, thereby balancing traffic across different routes of the network and achieving more uniform loading of nodes and links with traffic data.
  • the route finder component 207 may route a single connection over several different routes. This "splitting" of connection over routes may be necessary where the connection requires a high bandwidth capacity.
  • the number of routes over which such a connection request may be split can be entered by a user, or the route finder itself may decide the number of routes over which to split the connection request up to a user defined upper bound.
  • the percentage of bandwidth capacity of a connection request to be divided across the number of selected routes can also be chosen by the user. For example, if the connection request's bandwidth capacity is to be divided across a first and a second route then 30% of the connection request's bandwidth capacity can be carried across the first route and 70% of the connection request's bandwidth capacity can be carried by the second route.
  • a single connection may be distributed across multiple paths across the network. Traffic between source node n_1 and destination node n_7 in response to a service request may be carried over an integer number of multiple paths. For example, a first route may traverse nodes n_2 and n_6, carrying 70% of the data of the service. A remaining 30% of the data of the service may be routed via nodes n_3 and n_5.
  • the distribution of routes may be user specified, or alternatively optimized by genetic algorithms.
  • a default condition whereby a single route carries all traffic relating to a source-destination service request may be set by a user.
  • Fig. 9 of the accompanying drawings illustrates the network graph nodes and links shown in Fig. 8 but with the network links having multiple costs, denoted by numerical values separated by a slash symbol (/).
  • the multiple costs may be associated with different traffic types, eg voice or data.
  • the route finder any select paths for connections taking into account the traffic type used by the connection.
  • the route finder component 207 may deal with point to multipoint traffic as illustrated with reference to Fig. 9 herein as follows. For traffic originating at source node n_1 and terminating at multiple destinations nodes n_8 and n_7, routes n_1, n_2, n_6, n_8 and routes n_1 n_3, n_5, n_7 may be selected, or routes n_1, n_2, n_6, n_7 and route n_1, n_2, n_6, n_8 may be selected. Other combinations are possible even in the simple example illustrated with reference to Fig. 9. Further, for point to point or point to multipoint services, routing may be selected according to traffic data type.
  • a user may interact with a route finder component 207 by use of graphical user interface 211, to edit and alter data already input from a network application or to enter data directly.
  • Data editing and entry is achieved by manipulation of a cursor icon using a computer peripheral pointing device, eg a mouse, trackball device or similar, across a series of display screens, various ones of which are described hereunder.
  • Fig. 10 of the accompanying drawings illustrates a network data editor screen display which a user may use to create or edit network topology data.
  • the network data editor which is part of the GUI 211, may be used to produce network data for the route finder engine 209 as an alternative to network data pre-processor 401 receiving network topology data 408 and converting it to an SAP file.
  • Nodes 1001 appear on the display window of a screen as icons and given labels 1002. Links between nodes can also be drawn, represented by lines 1003.
  • the display includes a horizontal scroll bar 1005 and a vertical scroll bar 1004 which the user may use to draw a network topology of greater area than currently shown in the display window.
  • the network topology data drawn is saved using a file name 1006.
  • the file saved is preferably a file conforming to the SAP format.
  • Fig. 11 of the accompanying drawings illustrates a link data editor screen display which a user may use to edit data describing network links.
  • the link data editor part of the GUI 211 may be used to produce network data for the route finder engine 209 as an altemative to network data pre-processor 401 receiving network topology data 408 and converting it to an SAP file.
  • the screen display comprises a dialog box showing a name of a link, that is, the link's two end points (each end point having a node label and a port number).
  • the display also comprises two icons 1102 which may be used to specify whether the link is for full duplex or half duplex (ie bi or uni directional, respectively).
  • a bandwidth capacity of the link may also be edited by selecting a numerical value which is presented in a scroll menu display 1103.
  • Costs associated with a link may also be entered and edited, for example a cost of voice data for the link may be edited by entering a numerical value 1104, in a cost data entry portion of the display window 1104. Likewise for data traffic 1105.
  • Fig. 12 of the accompanying drawings illustrates an example of a text file having SAP format which may be entered into the route finder engine from network data pre-processor 403 or resulting from the network topology data editor shown in Fig. 10 or the link data editor shown in Fig. 11.
  • a file in SAP format may comprise a plurality of lines containing ASCII characters with each line terminated by an ASCII new line character.
  • the SAP file comprises a plurality of sections, with each section having a header line followed by one or more data description lines.
  • a header line 1201 for a node section comprises:
  • a node description line 1202 comprises a node label which acts as an identifier for the node, XY coordinates corresponding to a coordinate grid of a node and a numerical value denoting capacity.
  • An example node description line comprises:
  • a link section describing network links has a header line 1203 comprising:
  • a link description line 1204 defines a single link between a pair of nodes.
  • a link description line may comprise two end points (each end point described by a node label and a number representing a node port), a value denoting the total capacity of the link and an identifier indicating whether the link is simplex or duplex (ie whether traffic on the link can be uni- or bi-directional).
  • An example of link description comprises:
  • a header line 1205 for a link state section comprises:
  • a description line describing link state capacity usage 1206 may comprise two end points and a numerical value denoting link capacity used, eg:
  • This example represents a link between port 1 of node n_1 and port 1 of node n_2, having 402 units of capacity already allocated.
  • the route finder engine does not place a unit of measurement on the number of 402 units. Thus, as long as the capacity and load utilization are measured in the same units, the numerical values denoting capacity and load can both be sent to the generic route finder engine 209.
  • a header line 1207 of a node state section comprises:
  • a node state description line 1208 may comprise a node label (which should be already defined in a node description section, any lines containing undefined node labels will be ignored) and a value denoting current capacity utilization of the node, for example:
  • node n_1 has a present allocated capacity of 1. No unit of measurement is placed on the file by the generic route finder engine, since the route finder manager 208 sends all data to the generic route finder engine in the same units.
  • a header line 1209 for a link reliability section comprises:
  • a link reliability description line 1210 defining reliability of a single link may comprise two end points (each having a node label and a port number) and a real number having a value between 0 and 1.0 (1.0 denoting 100% link reliability), eg:
  • This example represents a link between port 1 of node n_1 and port 1 of node n_2, having a link reliability factor of 0.999.
  • a header line 1211 for a node reliability section comprises:
  • a description line 1212 defining reliability of a single node comprises a node label and a real number having a value between 0 and 1.0 (1.0 denoting 100% node reliability):
  • a header line 1213 for a costs section comprises:
  • a description line 1214 defining the cost of a single link comprises two end points (each end point having a node label and a port number) and one or more data types with a numerical value representing the cost, eg:
  • This example illustrates a link between port 2 of node n_1 and port 3 of n_2 which has a cost value of 1 for data service traffic and a value of 2 for voice service traffic. That is to say, the link has a lower cost for data traffic than for voice traffic.
  • the measurement of cost has no unit.
  • the cost value is used by the generic route finder engine to find shortest paths from which a final choice of paths is made and is used in the calculation of minimum spanning trees.
  • Fig. 13 of the accompanying drawings illustrates a screen display which can be used to generate service requests.
  • the screen display is generated by a service request generator, part of the GUI 211, which may be used to generate service requests for the route finder engine 401 as an altemative to service request pre-processor 400 receiving service requests from an extemal application and converting them to a SAP file.
  • the screen display comprises a two dimensional table in which vertical entries 1301 represent source nodes and horizontal entries 1302 represent destination nodes of connections. Entries 1303 in the table represent service request numbers for connections between the entry's source and destination nodes.
  • the display also includes a selector 1304 used to select the type of traffic, eg voice or data, required by the service requests.
  • Fig. 14 of the accompanying drawings illustrates a screen display which may be used to view of create routes for point to multipoint connections.
  • the screen display may be generated by means of GU211.
  • the screen display comprises a scroll box 1401 which may be used to select a source node for the connection.
  • the screen display also comprises an accepted destination box 1402 comprising a completion list 1404, an edited list 1405, a right arrow icon 1406, a left arrow icon 1407, an apply button 1408 and a cancel button 1409.
  • the completion list 1404 may comprise a scroll box containing a list of all or some of the network's nodes which may be selected as destination nodes in a point to multipoint connection.
  • Selecting a node from list 1404, eg by clicking on it with a mouse pointer, and then clicking the right arrow icon 1406 may enter the selected node into edited list 1405. Nodes appearing in a scroll box comprising edited list 1405 may be selected by clicking with the mouse pointer. Clicking left arrow icon 1407 after selecting one or more nodes from edited list 1405 may result in the selected node being removed from the edited list. Selecting apply button 1408 may result in applying the selected destination node to a particular point to multipoint connection. Selecting cancel button 1409 may discard any operations performed upon elements of accepted destination box 1402.
  • the screen display also comprises a traffic selection box 1403, which may be used to enter a numerical value denoting a required bandwidth of a point to multipoint connection.
  • the screen display also comprises a traffic type selection scroll box 1410, which may be used to select a type of traffic to be used on a particular connection, the types may comprise voice, data, default or video.
  • the screen display further comprises a multipoint requests scroll box 1411 which may be used to display connections selected using source and destination boxes 1401, 1402.
  • the multipoint request box 1411 may display a connection comprising a source node selected using source box 1401 and destination nodes selected using the lists in accepted destination box 1402 and confirmed using apply button 1408.
  • the screen display also comprises close button 1412 which may be used to exit the screen display.
  • Fig. 15 of the accompanying drawings illustrates a screen display which can be used to create or edit data representing constraints on routes found for specified service requests.
  • the screen display is generated by a constraints data creator part of the GUI 211, which may be used as an alternative to traffic data preprocessor 400 receiving service requests from an extemal application including route constraints and converting them to a SAP file.
  • the screen display comprises a dialog containing a scroll box 1501 which may be used to select a source node.
  • the display also comprises a scroll box 1502 which may be used to select destination node(s).
  • the display also comprises a scroll box 1503 used to select the traffic type between the selected source and destination nodes which is to be constrained.
  • the display comprises two selection boxes 1505 used to select whether nodes or links are to be selected.
  • buttons 1504 are also used to select whether the selected nodes or links will be excluded or included from the route.
  • a list of nodes or links 1506 is also shown in the display, depending upon whether nodes or links were selected using selection boxes 1505. Nodes or links may be selected from list 1506 in order to generate constraints which will be included or excluded for routes found between the selected source and destination nodes selected using scroll boxes 1501 and 1502, respectively.
  • Fig. 16 of the accompanying drawings illustrates an example text file having SAP format which may be entered into the route finder engine from an external application via service request pre-processor 400 or by the traffic data editors shown in Fig. 13 and Fig. 14.
  • the example shown in Fig. 16 illustrates sections defining data relating to network traffic.
  • the SAP file comprises a number of sections, with each section having a header line and one or more description lines.
  • a header line 1501 for a traffic section comprises:
  • a description line 1602 for a point-to-point service request comprises a numerical identifier for the service request, a source node label, a destination node label, a numerical value denoting capacity required by the service, a traffic type identifier and a numerical value denoting number of routes over which to split total capacity requirement, and a splitting mechanism.
  • the splitting mechanism may be a symbol * indicating that the route finder engine determines a percentage split of traffic over the indicated number of routes, rather than this split being determined in the service equipment.
  • a service request identified as service request 983 comprises a point to point request for service connection between node n_1 and n_8 having a consumption of 165 units of bandwidth, and which is to use 5 routes.
  • the symbol * denotes that the percentages of data traversing each of the 5 routes are to be determined by the generic route finder engine.
  • the point to point service request description line will include numerical values instead of the symbol * which denotes the percentage split, for example to split capacity equally (50% to 50%) over two routes.
  • * which denotes the percentage split, for example to split capacity equally (50% to 50%) over two routes.
  • the service request identified as number 984 between node n_2 and n_3 having capacity consumption of 210 units carries voice data traffic over 2 routes split equally at 50% over each route.
  • a header line for a multi-point section 1604 comprises:
  • a description line 1605 defining a point to multi-point service request may comprise a numerical service request identifier, a source node label, a plurality of destination node labels and a numerical value denoting capacity required by the service request. For example:
  • This example indicates a service request identifier 985 being a multi-point connection between node n_1, and nodes n_2 and n_3 with a bitrate consumption of 160 data units, carrying data type traffic.
  • a header line 1606 for a constraints section comprises:
  • a description line 1607 defining links which should be included in a route for a particular service request comprises a numerical value corresponding to a defined service request (point to point or point to multi-point), the word "include”, the word "link”, and a list of one or more links with each link listed comprising two end points (each end point comprising a pair of node labels and ports), eg:
  • This example denotes a service request identified as number 983 including links between port 1 of node n_1 and port 1 of node n_2, and port 2 of node n_2 and port 2 of node n_3.
  • a description line 1608 defining nodes to be excluded from route(s) found for a particular service request comprises a numerical service request identifier, the word "exclude”, the word “node” and a list of node labels, eg:
  • nodes could be included from the route(s) found for the service request by replacing "exclude” with “include”.
  • FIG. 17 of the accompanying drawings illustrates an example of a SAP format file.
  • the example file shown in Fig. 17 includes sections defining evaluation function related parameters. Data describing parameters which the route finder engine's genetic algorithms may consider when determining routes for service requests are described in a problem parameters section.
  • a header 1701 for a problem parameters section comprises:
  • a header line 1704 for a GA parameter section comprises:
  • SAP files illustrated in Fig. 12, Fig. 16 and Fig. 17 of the accompanying diagrams may be included in one SAP file and entered into the route finder engine 401.
  • Fig. 18 of the accompanying drawings illustrates steps executed during step 504 of Fig. 5 which applies the route finder's genetic algorithms to find routes for the service requests entered.
  • the parameters and instructions are entered into the route finder engine.
  • the parameters which may be entered comprises variables which may be used to control the route finder engine's genetic algorithms.
  • the variables may be given values by using a "set" which has a instruction of the form: Set ⁇ variable name > ⁇ value > where ⁇ variable name > is a name of a supported route finder engine variable, and ⁇ value > is a value to be assigned to the variable.
  • the variables supported by the GA meter engine comprise: Name Meaning crossoverProb Crossover Probability mutationProb Mutation Probability poolSize Size of population miniParents Minimum number of parents maxParents Maximum number of parents subpopPercentOfChromosomes Percent of population selected lambda Used in exponential selection mechanism bestFitlnnacuracy Used in merging solutions tendencyPressure Pressure applied in selecting solutions replacePressure Pressure applied when merging solutions mergeMechanism Mechanism used when merging solutions crossoverMechanism Mechanism used in crossover noOfCrossoverPoints Number of crossover points selectedMechanism Mechanism used for selection statsCollectionMechanism Mechanism used for selection statsCollectionMechanism Collects stats, per generation or new solution randomSeedMechanism Mechanism used for random seed generation randomSeed Random seed used terminateAfterTime Force experiment termination after time maximumTime Maximum time allowed terminateAfterGens Force termination after specified generations maximumGens Maximum generations allowed maximumNoChangeGens Maximum number of generations allowed without finding a new solution statsFileFormat Format of statistics file noExperiments Number of experiments to perform
  • the instructions which may be entered into the route finder engine include a "command" instruction.
  • the command instructions are interpreted by engine control process 600 of the route finder generic engine 209 to load or save files, start an optimization process, or terminate operation of the generic route finder engine.
  • a command instruction has a number of distinct forms, including:
  • a batch file comprising "set” and “command” instructions may be created and saved using a filename.
  • Such a batch file may be executed by the route finder engine by an instruction:
  • a representation of routes found by the route finder engine for a point-to-multi-point connection for a service request comprises a string of contiguous bits.
  • Fig. 19 of the accompanying drawings illustrates a graph 1901 of nodes (labeled n_1 to n_8) and links.
  • a point-to-multi-point connection request is received specifying source node n_1 and destination nodes n_2, n_3 and n_7. These source and destination nodes are shown in black on the graph.
  • Nodes not included in the point-to-multi-point connection request include nodes n_4, n_5, n_6 and n_8, these nodes are shown as white or hatched in the graph 1901.
  • each node that is not in the point-to-multi-point connection request requires one bit of data storage.
  • n_4, n_5, n_6 and n_8 in order.
  • a single source node may be connected to a plurality of destination nodes over a plurality of links.
  • a pattem of links may form a tree structure, where nodes in the tree may form places where branches of the tree may divide.
  • a Steiner tree is a smallest tree connecting all nodes of a specified set of nodes. By smallest tree, it is meant a tree having a minimum number of links.
  • the bits corresponding to nodes not included in the point-to-multi-point connection request are set to zero if they form part of a Steiner tree for the source and destination nodes included in the point-to-multi-point connection request, called Steiner Vertices.
  • the bits are set to zero if they are not Steiner Vertices.
  • a Steiner tree can be generated using a known minimum spanning tree algorithm such as the Prim Kruskal algorithm. The minimum spanning tree algorithm connects the source node, destination nodes and Steiner Vertices together.
  • node n_6 only (shown hatched in Fig.
  • Graph 2503 illustrates a Steiner tree of Steiner Vertices for nodes included in the point-to-multi-point connection request n_1 to n_2, n_3, n_7 and nodes which have the value 1 in the representation for that point-to-multi-point connection request (n_6).
  • the route finder engine uses the traffic routing representation to search for routes for entered point-to-multi-point connection requests according to the parameters and instructions entered at step 1801.
  • Fig. 20 of the accompanying drawings illustrates steps executed by the route finder engine to route point-to-multi-point connection requests at step 1803 of Fig. 18.
  • an initial population each member of which comprises a bit string as defined in the generate representation step 1802 above.
  • the initial population generated comprises one or more members, each member having random bit values. Random bit values in the bit strings for each point-to-multi-point connection request represent all intermediate nodes in the network, ie nodes which are not included in the point-to-multi-point connection request and have values of 1 if they are considered to be Steiner Vertices as described hereinabove or 0 otherwise.
  • Output of an initial population generation step is called a current population.
  • a fitness evaluation process is invoked in order to compute a fitness of each current population member.
  • the fitness evaluation process assigns a numerical value to each population member in order that the members can be ranked and used in later steps of Fig. 20.
  • the fitness evaluation process indicates increased desirability of a population member by a lower fitness numerical value, that is, the route finder engine's genetic algorithm searches for a minimum numerical value.
  • the fitness numerical value of each population member is calculated by computing a Steiner tree for each point-to-multi-point connection request which results in a bit string as described above.
  • a cost of traversing the network links included in the Steiner tree for the point-to-multi-point connection request is calculated, eg by adding all the link costs for each route in the connection, and a numerical value is produced.
  • a numerical value denoting the fitness evaluation of the population member is then calculated by adding up the numerical cost of each route of each point-to-multi-point connection request in the population member to give a numerical value.
  • step 2002 population reproduction occurs to create an intermediate population.
  • the intermediate population is generated by sampling - with replacement - the current population according to a distribution which is fitness related and defined by parameters entered into the route finder engine at step 1801.
  • the intermediate population is the same size as the current population and has a decreased average fitness numerical value, ie more desirable, when compared to that of the current population.
  • the intermediate population is genetically manipulated to produce a manipulated population.
  • the genetic manipulation involves cross-over and mutation operations.
  • Fig. 21 of the accompanying diagrams illustrates an example of genetic manipulation. Two intermediate population members, each being a string of nine bits are shown.
  • the cross-over operation involves swapping a number of bits of one population member with another, the number of bits being determined by parameters entered into the route finder engine at step 1801.
  • a first intermediate population member comprises of five left most bits 2101 and four right most bits 2102.
  • a second intermediate population member comprises five left most bits 2103 and four right most bits 2104.
  • the cross-over operator is set up to swap five left most bits of population members.
  • the first intermediate population member comprises five left most bits 2103 and four right most bits 2102 and the second intermediate population member comprises five left most bits 2101 and four left most bits 2104.
  • a bit wise mutation operation is applied to the crossed-over population members.
  • the mutation operator used is determined by parameters entered into the route finder engine at step 1801. In the example shown in Fig. 21 the bit wise mutation operation results in a single bit of each 9 bit long population member being inverted.
  • the fitness evaluation process is invoked in order to compute the fitness values of the manipulated population.
  • the genetic manipulation process sorts the manipulated population according to fitness value.
  • a merge populations process is executed.
  • the function of the merge population process is to take members of the current, intermediate and manipulated populations and form a new current population.
  • Mechanisms used in this merged populations process are determined by particular control parameters entered at step 1801.
  • the new current population generated at step 2004 has its fitness evaluated by the fitness evaluation process described above.
  • control may be passed back to step 2002 or the genetic algorithms may terminate at step 2006.
  • the route finder engine outputs a list of routes corresponding to population members having the minimum fitness numerical value, ie the most desirable.
  • the list of routes is generated by listing the nodes contained in the shortest path array element indexed by the bits for each point-to-point connection request in the fittest population member.
  • the route finder engine outputs an SAP format file with a section describing the routes found for the service requests entered, an example of which is given in Fig. 22 herein.
  • a header line 2201 for a routes section comprises:
  • a description line for a route sections has the following format: ⁇ no> ⁇ source> ⁇ destination> ⁇ traffic type> ⁇ routes> ⁇ wherein:
  • a SAP file containing a routes section may be converted by route data post processor 403 into a routing table suitable for the extemal application which made the service requests.
  • Fig. 23 of the accompanying diagrams illustrates a screen display which GUI 211 may produce to graphically illustrate a routing table using data produced by the route finder engine 209.
  • the screen display comprises a window with a table 2301, each row of which represents a service request between a source node and a destination node of the network and each column of which represents a hop, ie a node contained in a route found for the service request.
  • the screen display also comprises two selection buttons 2302 which may be used to show routing tables for traffic of different types, eg voice or data.
  • the display also comprises a horizontal scroll bar icon 2304 and a vertical scroll bar icon 2303 which may be used to display connection requests and hops not visible in the current display.
  • Fig. 24 of the accompanying drawings illustrates a screen display showing a chart produced by GUI 211 using data produced by the route finder engine 209.
  • a horizontal axis 2401 of the chart illustrates percentage utility of links in the network, whilst a vertical axis 2402 of the graph represents frequency of the percentage utilization.

Landscapes

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

Claims (14)

  1. Verfahren zum Suchen von Routen von Verbindungsstrecken für eine Vielzahl von Kommunikations-Verbindungen über ein Netzwerk, das eine Vielzahl von Knoten-Elementen (101; 301) und Verbindungsstrecken-Elementen (102; 302) umfasst, wobei jede Verbindung ein Quellen-Knoten-Element und eine Vielzahl von Ziel-Knoten-Elementen hat, wobei das Verfahren die folgenden maschinenausführbaren Schritte umfasst:
    Zuordnen von zumindest einem Verbindungsstrecken-Kosten-Wert (C1 - C12) zu jedem Verbindungsstrecken-Element (102; 301);
    für jede Verbindung, deren Route zu führen ist, Auswerten eines Routen-Kosten-Wertes des Durchquerens einer Vielzahl von Verbindungsstrecken-Elementen zwischen dem Quellen-Knoten-Element und der Vielzahl von Ziel-Knoten-Elementen; und
    für alle die Verbindungen, deren Route zu führen ist, Auswerten der Gesamtkosten der Routen-Kosten-Werte;
       wobei das Verfahren dadurch gekennzeichnet ist, dass es für jede genannte Verbindung, deren Route zu führen ist, die folgenden Schritte einschließt: Auswählen eines Satzes von Knoten-Elementen (101; 301) des Netzwerkes, die nicht in einem Quellen-Knoten-Element oder einer Vielzahl von Ziel-Knoten-Elementen der Verbindung enthalten sind; und Feststellen, welches der Knoten-Elemente in dem Satz Steiner-Vertizes sind.
  2. Verfahren nach Anspruch 1, bei dem der Satz von Knoten-Elementen (102; 302) durch eine Folge von Bits (1902) dargestellt ist,
       wobei ein Bit in der Folge einen Wert von 1 hat, wenn das durch dieses Bit dargestellte Knoten-Element als ein Steiner-Vertex markiert ist, und
       ein Bit in der Folge einen Wert von 0 hat , wenn das durch dieses Bit dargestellte Knoten-Element nicht als ein Steiner-Vertex markiert ist.
  3. Verfahren nach Anspruch 1 oder 2, bei dem der Schritt der Auswertung eines Routen-Kosten-Wertes die folgenden Schritte umfasst:
    Schaffen eines Steiner-Baumes (610), der Knoten in jeder genannten Verbindung, deren Route zu führen ist, und Knoten in den Satz einschließt, die als Steiner-Vertizes markiert sind; und
    Addieren der Kosten-Werte (609) des Durchquerens jeder Verbindungsstrecke in dem Steiner-Baum.
  4. Verfahren nach Anspruch 2 oder 3, bei der die Folge von Bits unter Verwendung von genetischen Algorithmus-Operationen (606), manipuliert wird, die die Reproduktion, die Mutation, die Kreuzung und die Vereinigung einschließen.
  5. Verfahren nach einem der Ansprüche 1 bis 4, bei dem der Kosten-Wert oder die Kosten-Werte, die dem Verbindungsstrecken-Element oder den Verbindungsstrecken-Elementen zugeordnet sind, einem Daten-Typ zugeordnet werden, und wobei das Verfahren den Schritt der:
    Zuordnung eines Daten-Typs zu allen oder einigen der Verbindungen umfasst, deren Route zu führen ist.
  6. Verfahren nach einem Ansprüche 1 bis 5, das den Schritt der:
    Auswahl von einem oder mehreren Knoten-Elementen (101; 301) und/oder eines oder mehrerer der Verbindungsstrecken-Elemente (102; 302) umfasst, die in die für eine oder mehrere der Verbindungen, deren Route zu führen ist, gefundene Route einzufügen oder aus dieser auszuschließen sind.
  7. Verfahren nach einem der Ansprüche 1 bis 6, das den Schritt der:
    Ausgabe der Routen mit minimalen Gesamtkosten (605) umfasst.
  8. Verfahren nach einem der Ansprüche 1 bis 7, bei dem eine Vielzahl von Routen für jede genannte Verbindung, deren Route zu führen ist, gefunden wird, wobei die Routen-Kosten für jede der Vielzahl von Routen nicht die Verbindungs-Kosten der Verbindung überschreiten, deren Route zu führen ist.
  9. Verfahren nach einem der Ansprüche 1 bis 8, bei dem die für alle die genannten Verbindungen gefundenen Routen bestrebt sind, so viele der Knoten-Elemente (101; 301) und Verbindungsstrecken-Elemente (102; 302) des Netzwerkes wie möglich zu verwenden.
  10. Verfahren nach einem der Ansprüche 1 bis 9, bei dem die Gesamtkosten der Routen-Kosten-Werte aller der Verbindungen, deren Route zu führen ist, als ein Fitness-Kriterium (609) in einem genetischen Algorithmus verwendet werden.
  11. Routen-Suchvorrichtung (207) zum Suchen von Routen von Verbindungsstrecken für eine Vielzahl von Kommunikationsverbindungen über ein Netzwerk, das eine Vielzahl von Knoten-Elementen (101; 301) und Verbindungsstrecken-Elementen (102; 302) umfasst, wobei jede Verbindung ein Quellen-Knoten-Element und eine Vielzahl von Ziel-Knoten-Elementen aufweist, wobei die Vorrichtung folgendes umfasst:
    Einrichtungen zum Zuordnen von zumindest einem Verbindungsstrecken-Kosten-Wert (C1 - C12) zu jedem Verbindungsstrecken-Element (102; 302);
    Einrichtungen zum Auswerten eines Routen-Kosten-Wertes des Durchquerens einer Vielzahl von Verbindungsstrecken-Elementen zwischen den Quellen-Knoten-Elementen und der Vielzahl von Ziel-Knoten-Elementen für jede Verbindung, deren Route zu führen ist; und
    Einrichtungen zum Auswerten der Gesamtkosten der Routen-Kosten-Werte für alle Verbindungen, deren Route zu führen ist;
       wobei die Vorrichtung dadurch gekennzeichnet ist, dass sie folgendes einschließt: Einrichtungen zur Auswahl eines Satzes von Knoten-Elementen (101; 301) des Netzwerkes, die nicht in einem Quellen-Knoten-Element oder einer Vielzahl von Ziel-Knoten-Elementen der Verbindung enthalten sind; und Einrichtungen zur Feststellung, welche der Knoten-Elemente in dem Satz Steiner-Vertizes für jede genannte Verbindung sind, deren Route zu führen ist.
  12. Netzwerk-Steuerung (104), die die Routen-Suchvorrichtung nach Anspruch 11 einschließt.
  13. Telekommunikationsnetzwerk, das die Netzwerk-Steuerung (104) nach Anspruch 12 einschließt.
  14. Maschinenlesbares Medium, das Computer-Code-Einrichtungen umfasst, die auf einem Prozessor (202) der Netzwerk-Steuerung (104) nach Anspruch 12 ausführbar sind, um das Verfahren nach einem der Ansprüche 1 bis 10 zu realisieren.
EP98309749A 1997-12-24 1998-11-27 Verkehrswegesucher in einem Kommunikationsnetz Expired - Lifetime EP0926860B1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
GB9727163A GB2332809A (en) 1997-12-24 1997-12-24 Least cost routing
GB9727163 1997-12-24

Publications (3)

Publication Number Publication Date
EP0926860A2 EP0926860A2 (de) 1999-06-30
EP0926860A3 EP0926860A3 (de) 2001-06-27
EP0926860B1 true EP0926860B1 (de) 2005-11-02

Family

ID=10824110

Family Applications (1)

Application Number Title Priority Date Filing Date
EP98309749A Expired - Lifetime EP0926860B1 (de) 1997-12-24 1998-11-27 Verkehrswegesucher in einem Kommunikationsnetz

Country Status (5)

Country Link
US (2) US6310883B1 (de)
EP (1) EP0926860B1 (de)
CA (1) CA2256223C (de)
DE (1) DE69832140T2 (de)
GB (1) GB2332809A (de)

Families Citing this family (168)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AUPQ504100A0 (en) * 2000-01-11 2000-02-03 Notron (No. 325) Pty Limited A method for distribution of streamed data packets on a switched network utilising an intelligent distribution network
GB9603582D0 (en) 1996-02-20 1996-04-17 Hewlett Packard Co Method of accessing service resource items that are for use in a telecommunications system
US6016307A (en) * 1996-10-31 2000-01-18 Connect One, Inc. Multi-protocol telecommunications routing optimization
JP3665460B2 (ja) * 1997-12-05 2005-06-29 富士通株式会社 分散自律協調型の応答時間チューニングによる経路選択システム、方法、及び記録媒体
US6249801B1 (en) * 1998-07-15 2001-06-19 Radware Ltd. Load balancing
US6665702B1 (en) * 1998-07-15 2003-12-16 Radware Ltd. Load balancing
US6298381B1 (en) * 1998-10-20 2001-10-02 Cisco Technology, Inc. System and method for information retrieval regarding services
US9239763B2 (en) 2012-09-28 2016-01-19 Oracle International Corporation Container database
US6873616B1 (en) * 1998-12-28 2005-03-29 Nortel Networks Limited Quasi-deterministic gateway selection algorithm for multi-domain source routed networks
JP2000222382A (ja) * 1999-02-03 2000-08-11 Fujitsu Ltd 一般の距離空間における適切なネットワーク形状を探索する処理装置
JP3766223B2 (ja) * 1999-02-18 2006-04-12 富士通株式会社 境界装置及びそのコネクション設定方法
JP2000242574A (ja) * 1999-02-22 2000-09-08 Mitsubishi Electric Corp データ転送方法および予定転送先データベース作成方法
US6643699B1 (en) * 1999-03-10 2003-11-04 International Business Machines Corporation Computerized method for computing the overall splitting cost of a data structure using blocking island contour map of a network-level graph
US6631128B1 (en) * 1999-05-27 2003-10-07 Telefonaktiebolaget L M Ericcson (Publ) Core network optimization of topology and technology for traffic handling
US6721414B1 (en) * 1999-08-17 2004-04-13 Nec America, Inc. Cable management system
US6757306B1 (en) * 1999-09-07 2004-06-29 Nortel Networks Limited Method and system for intermediate system level 2 transparency using the SONET LDCC
US6701367B1 (en) 1999-09-24 2004-03-02 Sun Microsystems, Inc. Mechanism for enabling customized session managers to interact with a network server
US6766349B1 (en) 1999-09-24 2004-07-20 Sun Microsystems, Inc. Mechanism for obtaining a thread from, and returning a thread to, a thread pool without attaching and detaching
WO2001022273A1 (en) 1999-09-24 2001-03-29 Sun Microsystems, Inc. Mechanism for enabling session information to be shared across multiple processes
US6895584B1 (en) * 1999-09-24 2005-05-17 Sun Microsystems, Inc. Mechanism for evaluating requests prior to disposition in a multi-threaded environment
US6744775B1 (en) * 1999-09-27 2004-06-01 Nortel Networks Limited State information and routing table updates in large scale data networks
US6822942B1 (en) * 1999-11-19 2004-11-23 At&T Corp. Protocol extensions for telecommunications network systems and method
US6738758B1 (en) * 1999-11-24 2004-05-18 Cisco Technology, Inc. Adaptive bucket indexing mechanism to effectively manage service activation requests
US7478162B2 (en) * 2000-02-08 2009-01-13 British Telecommunications Public Limited Company Communications network
US6842425B1 (en) * 2000-02-14 2005-01-11 Lucent Technologies Inc. Method and apparatus for optimizing routing through network nodes
US6816910B1 (en) * 2000-02-17 2004-11-09 Netzentry, Inc. Method and apparatus for limiting network connection resources
AU5609901A (en) * 2000-02-23 2001-09-03 Thinprint Gmbh Method for transmitting data in networks via data lines
US6977937B1 (en) * 2000-04-10 2005-12-20 Bbnt Solutions Llc Radio network routing apparatus
US6721800B1 (en) * 2000-04-10 2004-04-13 International Business Machines Corporation System using weighted next hop option in routing table to include probability of routing a packet for providing equal cost multipath forwarding packets
US6681248B1 (en) * 2000-04-12 2004-01-20 Sycamore Networks, Inc. Method for port connectivity discovery in transparent high bandwidth networks
US6873619B1 (en) * 2000-05-16 2005-03-29 Tavve Software Co. Methods, systems and computer program products for finding network segment paths
US7555542B1 (en) 2000-05-22 2009-06-30 Internap Network Services Corporation Method and system for directing requests for content to a content server based on network performance
US20020004843A1 (en) * 2000-07-05 2002-01-10 Loa Andersson System, device, and method for bypassing network changes in a routed communication network
US6839749B1 (en) * 2000-07-10 2005-01-04 International Business Machines Corporation Network representation and manipulation thereof
US6854091B1 (en) * 2000-07-28 2005-02-08 Nortel Networks Limited Method of displaying nodes and links
US6981055B1 (en) * 2000-08-22 2005-12-27 Internap Network Services Corporation Method and system for optimizing routing through multiple available internet route providers
GB0022561D0 (en) * 2000-09-14 2000-11-01 British Telecomm Communications network
US6631449B1 (en) * 2000-10-05 2003-10-07 Veritas Operating Corporation Dynamic distributed data system and method
US7003559B1 (en) * 2000-10-23 2006-02-21 Hewlett-Packard Development Company, L.P. System and method for determining probable network paths between nodes in a network topology
KR100657120B1 (ko) * 2000-11-04 2006-12-12 주식회사 케이티 패킷 망에서 트래픽부하 분산을 위한 라우팅방법
WO2002046947A1 (en) * 2000-12-04 2002-06-13 Rensselaer Polytechnic Institute System for proactive management of network routing
WO2002075483A2 (en) * 2001-01-11 2002-09-26 Nortel Networks Limtied Check pointing of processing context of network accounting components
US20030031167A1 (en) * 2001-02-28 2003-02-13 Singh Abhishek Ranjan Methods and system for efficient route lookup
US20020122388A1 (en) * 2001-03-05 2002-09-05 Taher Behbehani Dynamically reconfigurable intelligent content-based network
WO2002073889A1 (en) * 2001-03-13 2002-09-19 British Telecommunications Public Limited Company Communications network
US20020131409A1 (en) * 2001-03-13 2002-09-19 Frank David L. Self-healing multi-level telecommunications network
US7302634B2 (en) 2001-03-14 2007-11-27 Microsoft Corporation Schema-based services for identity-based data access
US7539747B2 (en) 2001-03-14 2009-05-26 Microsoft Corporation Schema-based context service
US7024662B2 (en) * 2001-03-14 2006-04-04 Microsoft Corporation Executing dynamically assigned functions while providing services
JP4451027B2 (ja) * 2001-07-11 2010-04-14 富士通株式会社 複数経路探索方法及びこれを適用するネットワーク装置
US7111074B2 (en) * 2001-07-24 2006-09-19 Pluris, Inc. Control method for data path load-balancing on a data packet network
EP2268095A1 (de) * 2001-08-14 2010-12-29 Sony Corporation Verfahren und Vorrichtungen zum Unterbrechen einer Verbindung zwischen einer Vorrichtung zur Informationsverarbeitung und einer externen Vorrichtung
US6678876B2 (en) * 2001-08-24 2004-01-13 Formfactor, Inc. Process and apparatus for finding paths through a routing space
US6862727B2 (en) 2001-08-24 2005-03-01 Formfactor, Inc. Process and apparatus for adjusting traces
US7331060B1 (en) 2001-09-10 2008-02-12 Xangati, Inc. Dynamic DoS flooding protection
US20040049595A1 (en) * 2001-12-04 2004-03-11 Mingzhou Sun System for proactive management of network routing
US7092378B1 (en) * 2001-12-10 2006-08-15 At & T Corp. System for utilizing a genetic algorithm to provide constraint-based routing of packets in a communication network
US7146000B2 (en) 2002-01-25 2006-12-05 Level (3) Communications Routing engine for telecommunications network
US7251221B2 (en) 2002-01-25 2007-07-31 Level 3 Communications, Llc Automated installation of network service in a telecommunications network
JP2003223322A (ja) * 2002-01-30 2003-08-08 Mitsubishi Electric Corp 組合せ最適化問題の解析装置
US7099277B2 (en) * 2002-02-20 2006-08-29 Mitsubishi Electric Research Laboratories, Inc. Dynamic optimal path selection in multiple communications networks
US6816886B2 (en) * 2002-03-14 2004-11-09 Microsoft Corporation Measuring performance metrics of networked computing entities
US7209656B2 (en) * 2002-04-12 2007-04-24 Fujitsu Limited Management of optical links using power level information
US7212742B2 (en) * 2002-04-12 2007-05-01 Fujitsu Limited Power level management in optical networks
US7209655B2 (en) * 2002-04-12 2007-04-24 Fujitsu Limited Sharing of power level information to support optical communications
US8351339B2 (en) * 2002-04-25 2013-01-08 Samsung Electronics Co., Ltd. Method for bluetooth on-demand routing and network formation, and communication method in bluetooth group ad hoc network
US9886309B2 (en) 2002-06-28 2018-02-06 Microsoft Technology Licensing, Llc Identity-based distributed computing for device resources
US7941514B2 (en) 2002-07-31 2011-05-10 Level 3 Communications, Llc Order entry system for telecommunications network service
US7305464B2 (en) * 2002-09-03 2007-12-04 End Ii End Communications, Inc. Systems and methods for broadband network optimization
US6957263B2 (en) * 2002-11-19 2005-10-18 Fujitsu Limited Connection management system and graphical user interface for large-scale optical networks
US7983239B1 (en) 2003-01-07 2011-07-19 Raytheon Bbn Technologies Corp. Systems and methods for constructing a virtual model of a multi-hop, multi-access network
US7457286B2 (en) * 2003-03-31 2008-11-25 Applied Micro Circuits Corporation Accelerating the shortest path problem
GB2418800B (en) * 2003-04-02 2006-06-21 Cisco Tech Inc Path optimization in communications and data networks
US7356578B1 (en) * 2003-05-28 2008-04-08 Landesk Software Limited System for constructing a network spanning tree using communication metrics discovered by multicast alias domains
US20040246902A1 (en) * 2003-06-02 2004-12-09 Weinstein Joseph J. Systems and methods for synchronizing multple copies of a database using datablase digest
US7577108B2 (en) * 2003-06-03 2009-08-18 Palo Alto Research Center Incorporated Learning-based strategies for message-initiated constraint-based routing
US7577107B2 (en) * 2003-06-03 2009-08-18 Palo Alto Research Center Incorporated Protocol specification for message-initiated constraint-based routing
US7246172B2 (en) * 2003-06-06 2007-07-17 Matsushita Electric Industrial Co., Ltd. Static dense multicast path and bandwidth management
US7881229B2 (en) 2003-08-08 2011-02-01 Raytheon Bbn Technologies Corp. Systems and methods for forming an adjacency graph for exchanging network routing data
US7953860B2 (en) * 2003-08-14 2011-05-31 Oracle International Corporation Fast reorganization of connections in response to an event in a clustered computing system
US7937493B2 (en) * 2003-08-14 2011-05-03 Oracle International Corporation Connection pool use of runtime load balancing service performance advisories
US7606927B2 (en) 2003-08-27 2009-10-20 Bbn Technologies Corp Systems and methods for forwarding data units in a communications network
US20080089347A1 (en) * 2003-08-29 2008-04-17 End Ii End Communications Inc. Systems and methods for broadband network optimization
US7668083B1 (en) 2003-10-28 2010-02-23 Bbn Technologies Corp. Systems and methods for forwarding data in a communications network
US7369765B2 (en) * 2004-02-26 2008-05-06 Fujitsu Limited Optical network with selective mode switching
US7969863B2 (en) * 2004-03-29 2011-06-28 Hewlett-Packard Development Company, L.P. Directed cost protocol
US7957266B2 (en) * 2004-05-28 2011-06-07 Alcatel-Lucent Usa Inc. Efficient and robust routing independent of traffic pattern variability
US7733812B2 (en) * 2004-06-07 2010-06-08 Alcatel Method for enabling multipoint network services over a ring topology network
US7620986B1 (en) 2004-06-14 2009-11-17 Xangati, Inc. Defenses against software attacks in distributed computing environments
CA2571654A1 (en) * 2004-06-22 2005-12-29 British Telecommunications Public Limited Company Wireless ad hoc network
US9262490B2 (en) 2004-08-12 2016-02-16 Oracle International Corporation Adaptively routing transactions to servers
GB0424032D0 (en) * 2004-10-28 2004-12-01 British Telecomm Resource allocation
US7564458B2 (en) * 2004-12-15 2009-07-21 Microsoft Corporation System and method for interactively linking data to shapes in a diagram
US9497109B2 (en) * 2005-02-11 2016-11-15 Hewlett Packard Enterprise Development Lp Switching mesh with user-configurable paths
US8010644B1 (en) * 2005-02-23 2011-08-30 Sprint Communications Company L.P. Method and system for deploying a network monitoring service within a communication network
US7940699B2 (en) * 2005-03-11 2011-05-10 Alcatel-Lucent Usa Inc. Spanning tree generation for supporting performance-guaranteed services over circuit-switched network
JP4073923B2 (ja) * 2005-03-30 2008-04-09 富士通株式会社 ネットワーク機器管理装置、ネットワーク機器管理プログラム、及びネットワーク機器管理方法
WO2007023010A2 (en) * 2005-08-25 2007-03-01 International Business Machines Corporation Method and system for displaying performance constraints in a flow design tool
US7978611B2 (en) * 2005-09-06 2011-07-12 At&T Intellectual Property I, L.P. Systems and methods to determine network routes based on transmission medium length
US20070064612A1 (en) * 2005-09-19 2007-03-22 Sbc Knowledge Ventures L.P. Method and apparatus for selecting an optimal path from a path-starting node of a network to a path-ending node of the network
GB2431067B (en) 2005-10-07 2008-05-07 Cramer Systems Ltd Telecommunications service management
US8352632B2 (en) 2005-10-26 2013-01-08 Level 3 Communications, Llc Systems and methods for discovering network topology
US7461035B2 (en) * 2005-10-26 2008-12-02 Motorola, Inc. Path determination facilitation method
GB2432992B (en) 2005-11-18 2008-09-10 Cramer Systems Ltd Network planning
US20070136209A1 (en) * 2005-12-06 2007-06-14 Shabbir Khan Digital object title authentication
US7720073B2 (en) * 2005-12-06 2010-05-18 Shabbir Khan System and/or method for bidding
US8014389B2 (en) * 2005-12-06 2011-09-06 Lippershy Celestial Llc Bidding network
US20070130046A1 (en) * 2005-12-06 2007-06-07 Shabbir Khan Quality of service for transmission of digital content
US8194701B2 (en) * 2005-12-06 2012-06-05 Lippershy Celestial Llc System and/or method for downstream bidding
US9686183B2 (en) 2005-12-06 2017-06-20 Zarbaña Digital Fund Llc Digital object routing based on a service request
US8055897B2 (en) 2005-12-06 2011-11-08 Lippershy Celestial Llc Digital object title and transmission information
US7894447B2 (en) * 2005-12-06 2011-02-22 Lippershy Celestial Llc Digital object routing
GB2433675B (en) 2005-12-22 2008-05-07 Cramer Systems Ltd Communications circuit design
GB2435362B (en) * 2006-02-20 2008-11-26 Cramer Systems Ltd Method of configuring devices in a telecommunications network
US7593342B2 (en) * 2006-03-16 2009-09-22 Mitsubishi Electric Research Laboraties, Inc. Route selection in cooperative relay networks
US20070300173A1 (en) * 2006-06-26 2007-12-27 Sun Microsystems, Inc. Apparatus and method for coordinated views of clustered data
US7672919B2 (en) * 2006-08-02 2010-03-02 Unisys Corporation Determination of graph connectivity metrics using bit-vectors
US7894370B2 (en) * 2007-03-09 2011-02-22 Nbc Universal, Inc. Media content distribution system and method
US8713186B2 (en) * 2007-03-13 2014-04-29 Oracle International Corporation Server-side connection resource pooling
US8069127B2 (en) * 2007-04-26 2011-11-29 21 Ct, Inc. Method and system for solving an optimization problem with dynamic constraints
US8717933B2 (en) * 2007-05-25 2014-05-06 Tellabs Operations, Inc. Method and apparatus for interactive routing
US7778202B2 (en) * 2007-06-01 2010-08-17 Tellabs Operations, Inc. Method and apparatus to provision network routes
US9961094B1 (en) 2007-07-25 2018-05-01 Xangati, Inc Symptom detection using behavior probability density, network monitoring of multiple observation value types, and network monitoring using orthogonal profiling dimensions
US8645527B1 (en) 2007-07-25 2014-02-04 Xangati, Inc. Network monitoring using bounded memory data structures
US8639797B1 (en) 2007-08-03 2014-01-28 Xangati, Inc. Network monitoring of behavior probability density
US20090080345A1 (en) * 2007-09-21 2009-03-26 Ericsson, Inc. Efficient multipoint distribution tree construction for shortest path bridging
US7851298B2 (en) * 2007-10-29 2010-12-14 Hynix Semiconductor Inc. Method for fabricating transistor in a semiconductor device utilizing an etch stop layer pattern as a dummy pattern for the gate electrode formation
US8761022B2 (en) 2007-12-26 2014-06-24 Rockstar Consortium Us Lp Tie-breaking in shortest path determination
US7911944B2 (en) * 2007-12-26 2011-03-22 Nortel Networks Limited Tie-breaking in shortest path determination
JP4586854B2 (ja) * 2008-02-05 2010-11-24 ソニー株式会社 表示生成装置、表示生成方法、プログラム、および無線通信システム
US7885269B2 (en) * 2008-03-03 2011-02-08 Microsoft Corporation Network analysis with Steiner trees
US8139504B2 (en) 2009-04-07 2012-03-20 Raytheon Bbn Technologies Corp. System, device, and method for unifying differently-routed networks using virtual topology representations
US8238538B2 (en) 2009-05-28 2012-08-07 Comcast Cable Communications, Llc Stateful home phone service
US10992555B2 (en) 2009-05-29 2021-04-27 Virtual Instruments Worldwide, Inc. Recording, replay, and sharing of live network monitoring views
US8549038B2 (en) 2009-06-15 2013-10-01 Oracle International Corporation Pluggable session context
GB2474227B (en) 2009-09-08 2012-02-08 Nds Ltd Delivering an audio video asset
US9184983B2 (en) * 2010-08-26 2015-11-10 Futurewei Technologies, Inc. Cross-stratum optimization protocol
US8532008B2 (en) * 2011-01-03 2013-09-10 Arnab Das Systems, devices, and methods of managing power consumption in wireless sensor networks
US8364717B2 (en) 2011-01-10 2013-01-29 Microsoft Corporation Hardware accelerated shortest path computation
US9160630B2 (en) * 2011-06-07 2015-10-13 Vmware, Inc. Network connectivity and security visualization
ES2614863T3 (es) 2011-06-17 2017-06-02 Huawei Technologies Co., Ltd. Control de servicio en nube informática y arquitectura de gestión extendida para conectarse al estrato de red
US8830821B2 (en) 2011-06-22 2014-09-09 Orckit-Corrigent Ltd. Method for supporting MPLS transport path recovery with multiple protection entities
US8443105B1 (en) * 2011-12-12 2013-05-14 The United States Of America As Represented By The Director, National Security Agency Device for and method of network routing
US8861506B2 (en) 2011-12-27 2014-10-14 Apple Inc. Shortest path determination for large graphs
US9001668B2 (en) * 2012-11-02 2015-04-07 Ixia Endpoint selection in a network test system
US9830369B1 (en) * 2013-05-14 2017-11-28 Jsonar, Inc. Processor for database analytics processing
US9525638B2 (en) 2013-10-15 2016-12-20 Internap Corporation Routing system for internet traffic
WO2015104753A1 (ja) * 2014-01-09 2015-07-16 日本電気株式会社 ノード装置
US9444714B2 (en) * 2014-08-07 2016-09-13 Microsoft Technology Licensing, Llc Estimating bandwidth in a network
US10135854B2 (en) * 2015-04-07 2018-11-20 Informatica Llc Method, apparatus, and computer-readable medium for generating a data proliferation graph
US9842148B2 (en) 2015-05-05 2017-12-12 Oracle International Corporation Method for failure-resilient data placement in a distributed query processing system
US9755737B2 (en) * 2015-10-08 2017-09-05 Ciena Corporation Multi-layer network resiliency systems and methods
US10289617B2 (en) 2015-12-17 2019-05-14 Oracle International Corporation Accessing on-premise and off-premise datastores that are organized using different application schemas
US10387387B2 (en) 2015-12-17 2019-08-20 Oracle International Corporation Enabling multi-tenant access to respective isolated data sets organized using different application schemas
IL244937A (en) * 2016-04-05 2017-07-31 Musman Lior Global optimization and network load balancing
US10303894B2 (en) 2016-08-31 2019-05-28 Oracle International Corporation Fine-grained access control for data manipulation language (DML) operations on relational data
US10474653B2 (en) 2016-09-30 2019-11-12 Oracle International Corporation Flexible in-memory column store placement
US11165863B1 (en) 2017-08-04 2021-11-02 128 Technology, Inc. Network neighborhoods for establishing communication relationships between communication interfaces in an administrative domain
US11954117B2 (en) 2017-09-29 2024-04-09 Oracle International Corporation Routing requests in shared-storage database systems
US20190253341A1 (en) 2018-02-15 2019-08-15 128 Technology, Inc. Service Related Routing Method and Apparatus
CN108924673B (zh) * 2018-06-12 2021-12-03 中国电力科学研究院有限公司 一种对光通道多点故障进行自愈的方法及系统
US10812371B2 (en) * 2018-10-12 2020-10-20 At&T Intellectual Property I, L.P. Methods, devices and systems for determining a target path in a network
US11563670B2 (en) 2018-10-12 2023-01-24 At&T Intellectual Property I, L.P. Methods, devices and systems for determining a target path
CN115428411B (zh) 2020-04-23 2024-05-28 瞻博网络公司 使用会话建立度量的会话监测
US20220006697A1 (en) * 2020-07-02 2022-01-06 Level 3 Communications, Llc Path computation tool for a communications network
WO2022034359A1 (en) * 2020-08-12 2022-02-17 Eci Telecom Ltd. Satisfying a set of services over given network resources
US11582135B2 (en) 2020-08-28 2023-02-14 Ciena Corporation Systems and methods for constrained path computation in networks with connectivity and resource availability rules
US11743169B2 (en) 2021-01-20 2023-08-29 Ciena Corporation Path computation systems and methods for concurrent bi-directional k-optimal paths

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4704724A (en) 1985-12-05 1987-11-03 Bell Communications Research, Inc. Routing of network traffic
US5309370A (en) * 1990-12-13 1994-05-03 Vlsi Technology, Inc. Method for placement of connectors used interconnecting circuit components in an integrated circuit
GB9112898D0 (en) * 1991-06-14 1991-07-31 Digital Equipment Int Communication networks
US5317566A (en) * 1993-08-18 1994-05-31 Ascom Timeplex Trading Ag Least cost route selection in distributed digital communication networks
JPH07245626A (ja) 1994-03-04 1995-09-19 Nippon Telegr & Teleph Corp <Ntt> 可変帯域適応型経路制御方法
GB2299729B (en) * 1995-04-01 1999-11-17 Northern Telecom Ltd Traffic routing in a telecommunications network
US5712907A (en) * 1995-09-18 1998-01-27 Open Port Technology, Inc. Pro-active message delivery system and method
GB2305811A (en) * 1995-09-26 1997-04-16 Northern Telecom Ltd Traffic routing in a telecommunications network
US5831975A (en) * 1996-04-04 1998-11-03 Lucent Technologies Inc. System and method for hierarchical multicast routing in ATM networks
US5754543A (en) * 1996-07-03 1998-05-19 Alcatel Data Networks, Inc. Connectivity matrix-based multi-cost routing
US5881243A (en) * 1997-05-07 1999-03-09 Zaumen; William T. System for maintaining multiple loop free paths between source node and destination node in computer network
US6151304A (en) * 1997-10-29 2000-11-21 Lucent Technologies Inc. Distributed precomputation of network signal paths with improved performance through parallelization

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ZHOU G. ET AL: "A new approach to the degree-constrained minimum spanning tree problem using genetic algorithm", SYSTEMS, MAN AND CYBERNETICS, 1996., IEEE INTERNATIONAL CONFERENCE ON BEIJING, CHINA 14-17 OCT. 1996, NEW YORK, NY, USA,IEEE, US, 14 October 1996 (1996-10-14), pages 2683 - 2688, XP010206541 *

Also Published As

Publication number Publication date
US6310883B1 (en) 2001-10-30
CA2256223C (en) 2004-05-11
GB9727163D0 (en) 1998-02-25
DE69832140T2 (de) 2006-04-20
GB2332809A (en) 1999-06-30
US6314093B1 (en) 2001-11-06
CA2256223A1 (en) 1999-06-24
EP0926860A2 (de) 1999-06-30
EP0926860A3 (de) 2001-06-27
DE69832140D1 (de) 2005-12-08

Similar Documents

Publication Publication Date Title
EP0926860B1 (de) Verkehrswegesucher in einem Kommunikationsnetz
US5426674A (en) Method and computer system for selecting and evaluating data routes and arranging a distributed data communication network
CA2141353C (en) Method of on-line permanent virtual circuit routing
US5459716A (en) Facility restoration for telecommunications networks
EP0637153B1 (de) Verfahren und Gerät zur automatischen Verteilung einer Netztopologie in Haupt- und Nebentopologie
CA2141354C (en) Method of routing multiple virtual circuits
US8443079B2 (en) Mixed integer programming model for minimizing leased access network costs
JPH1117704A (ja) 通信網内の承認制御の実時間制御アーキテクチャ
CN108173761A (zh) 一种sdn和nfv融合的资源优化方法
EP2767017B1 (de) Verfahren und system zur verwaltung eines optischen verteilungsnetzwerks
JPH10233773A (ja) 通信ネットワークにおける動作パラメーターのモニタリング方法及び装置
Pham et al. Congestion-aware and energy-aware virtual network embedding
CN110932981B (zh) 一种支持自动路由的数据交换系统
JPH10200529A (ja) 通信ネットワークのモニタリング方法及び装置
CN114500354B (zh) 一种交换机控制方法、装置、控制设备及存储介质
CN109743259A (zh) 一种网络的流量调度方法及装置
JP3184822B2 (ja) 制限的コストのための最適ｐｎｎｉ複合ノード表現を生成する方法、ネットワーク装置およびｐｎｎｉネットワーク
Montana et al. Adaptive reconfiguration of data networks using genetic algorithms
JPH10190661A (ja) 通信ネットワークのモニタリング方法及び装置
GB2332815A (en) Traffic route finder in communications network
JP2002314587A (ja) ルート設定方法、ルート設定サービス方法、ネットワーク経路管理システム及びネットワーク支援システム
GB2334852A (en) Automatic connections manager
Nguyen et al. Joint Node-Link Algorithm for Embedding Virtual Networks with Conciliation Strategy
JP3856837B2 (ja) 回線交換通信ネットワークにおけるマネージメントの方法および回線交換通信ネットワークにおいてノードとして用いることのできる装置
Raychev et al. Optimizing SDN Control Plane Scalability by Efficient Switch to Controller Migration

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 19981210

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): DE FR GB

AX Request for extension of the european patent

Free format text: AL;LT;LV;MK;RO;SI

RAP3 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NORTEL NETWORKS CORPORATION

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NORTEL NETWORKS LIMITED

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

AX Request for extension of the european patent

Free format text: AL;LT;LV;MK;RO;SI

AKX Designation fees paid

Free format text: DE FR GB

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NORTEL NETWORKS LIMITED

17Q First examination report despatched

Effective date: 20041015

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REF Corresponds to:

Ref document number: 69832140

Country of ref document: DE

Date of ref document: 20051208

Kind code of ref document: P

ET Fr: translation filed
PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20060803

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20101230 AND 20110105

REG Reference to a national code

Ref country code: FR

Ref legal event code: TP

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 69832140

Country of ref document: DE

Representative=s name: PATENTANWAELTE WALLACH, KOCH & PARTNER, DE

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 69832140

Country of ref document: DE

Representative=s name: PATENTANWAELTE WALLACH, KOCH, DR. HAIBACH, FEL, DE

Effective date: 20120213

Ref country code: DE

Ref legal event code: R082

Ref document number: 69832140

Country of ref document: DE

Representative=s name: PATENTANWAELTE WALLACH, KOCH & PARTNER, DE

Effective date: 20120213

Ref country code: DE

Ref legal event code: R081

Ref document number: 69832140

Country of ref document: DE

Owner name: CIENA LUXEMBOURG S.A.R.L., LU

Free format text: FORMER OWNER: NORTEL NETWORKS LTD., ST. LAURENT, QUEBEC, CA

Effective date: 20120213

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 18

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 19

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 20

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20171121

Year of fee payment: 20

Ref country code: DE

Payment date: 20171121

Year of fee payment: 20

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20171123

Year of fee payment: 20

REG Reference to a national code

Ref country code: DE

Ref legal event code: R071

Ref document number: 69832140

Country of ref document: DE

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Expiry date: 20181126

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20181126