[go: up one dir, main page]

Venables, 1992 - Google Patents

Algorithms for the spare capacity design of mesh restorable networks

Venables, 1992

View PDF
Document ID
8794684317963091862
Author
Venables B
Publication year

External Links

Snippet

Future systems for planning and operating mesh-restorable networks will require an efficient algorithm for spare capacity placement that assures restorability with a minimum of total protection capacity. This thesis proves that the problem of optimal spare capacity placement …
Continue reading at ualberta.scholaris.ca (PDF) (other versions)

Classifications

    • 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/04—Interdomain routing, e.g. hierarchical routing
    • 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
    • H04L45/121—Minimizing delay
    • 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/02—Topology update or discovery
    • 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
    • H04L45/123—Evaluation of link metrics
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • 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/48—Routing tree calculation
    • 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/22—Alternate routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/64—Distributing or queueing
    • H04Q3/66—Traffic distributors
    • 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/46—Cluster building
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/12—Arrangements for maintenance or administration or management of packet switching networks network topology discovery or management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/50—Network service management, i.e. ensuring proper service fulfillment according to an agreement or contract between two parties, e.g. between an IT-provider and a customer
    • H04L41/5041—Service implementation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/0016—Arrangements providing connection between exchanges
    • H04Q3/0062—Provisions for network management
    • H04Q3/0075—Fault management techniques

Similar Documents

Publication Publication Date Title
Kershenbaum et al. MENTOR: An algorithm for mesh network topological optimization and routing
Minoux Discrete cost multicommodity network optimization problems and exact solution methods
US20020097680A1 (en) Apparatus and method for spare capacity allocation
Resende Biased random-key genetic algorithms with applications in telecommunications
Jaumard et al. Efficient spectrum utilization in large scale RWA problems
US20170012856A1 (en) Network stochastic cross-layer optimization for meeting traffic flow availability target at minimum cost
Schloter et al. Fast and memory-efficient algorithms for evacuation problems
US7590067B2 (en) Method and apparatus for deriving allowable paths through a network with intransitivity constraints
Masri et al. Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem
Risso et al. Metaheuristic approaches for IP/MPLS network design
US8570875B2 (en) Determining collocations with an access transport management system (ATMS)
Venables Algorithms for the spare capacity design of mesh restorable networks
Myslitski et al. Toward fast calculation of communication paths for resilient routing
US6731608B2 (en) Complex node representations in PNNI systems
CN117978320A (en) Method and system for solving shortest disjoint path pair in WDM network
Shen et al. A tabu search algorithm for the routing and capacity assignment problem in computer networks
Akkanen et al. Case study of the evolution of routing algorithms in a network planning tool
Corez et al. Multi-overlay network planning by applying a Variable Neighborhood Search approach
CN113709605B (en) Method and device for calculating mutually exclusive group service route in optical transmission network planning
Doostie et al. A novel genetic algorithm-based methodology for large-scale fixed charge plus routing network design problem with efficient operators
Rego et al. A filter-and-fan algorithm for the capacitated minimum spanning tree problem
Amiri A system for the design of packet-switched communication networks with economic tradeoffs
Fortz Topology-constrained network design
JP7294450B2 (en) Apparatus, method and program for generating network topology
Fortz et al. Polyhedral approaches to the design of survivable networks