[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Clarke et al., 1995 - Google Patents

A bootstrap heuristic for designing minimum cost survivable networks

Clarke et al., 1995

View PDF
Document ID
3049833610361478371
Author
Clarke L
Anandalingam G
Publication year
Publication venue
Computers & operations research

External Links

Snippet

This paper provides a systematic approach based on heuristics for designing Minimum Cost Survivable Networks (MCSN). The Design System has two components; a heuristic for obtaining survivable network topologies, and a set of heuristics for improving the cost of the …
Continue reading at www.sciencedirect.com (PDF) (other versions)

Classifications

    • 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
    • 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/48—Routing tree calculation
    • 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
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • 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
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • 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/06—Arrangements for maintenance or administration or management of packet switching networks involving management of faults or events or alarms
    • 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/08—Configuration management of network or network elements
    • H04L41/0803—Configuration setting of network or network elements
    • 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/22—Arrangements for maintenance or administration or management of packet switching networks using GUI [Graphical User Interface]

Similar Documents

Publication Publication Date Title
Guo et al. Link‐disjoint paths for reliable QoS routing
Wang et al. Reliability-oriented and resource-efficient service function chain construction and backup
Chen et al. A review of automated formal verification of ad hoc routing protocols for wireless sensor networks
Clarke et al. A bootstrap heuristic for designing minimum cost survivable networks
Shooman Algorithms for network reliability and connection availability analysis
Chen et al. BD-ADOPT: a hybrid DCOP algorithm with best-first and depth-first search strategies
White et al. Genetic algorithms and network ring design
Clarke et al. An integrated system for designing minimum cost survivable telecommunications networks
Li et al. A Branch-And-Benders-Cut approach for the fault tolerant regenerator location problem
Wang et al. Reduction-based formal analysis of bgp instances
Risso et al. Metaheuristic approaches for IP/MPLS network design
Gomes et al. Protected shortest path visiting specified nodes
Genda et al. Multi-stage network recovery considering traffic demand after a large-scale failure
Gouveia et al. Designing reliable tree networks with two cable technologies
Crescenzi et al. Simple and fast distributed computation of betweenness centrality
Higham et al. Self-stabilizing minimum spanning tree construction on message-passing networks
Chlebus et al. Disconnected agreement in networks prone to link failures
Zhang et al. Computing bipath multicommodity flows with constraint programming–based branch-and-price-and-cut
Pascoal et al. On a relaxed maximally disjoint path pair problem: a bicriteria approach
Yang et al. On multi-path routing for reliable communications in failure interdependent complex networks
Li et al. Assisting reachability verification of network configurations updates with NUV
Bistarelli et al. Semiring‐based frameworks for trust propagation in small‐world networks and coalition formation criteria
Baldoni et al. Counting on anonymous dynamic networks: Bounds and algorithms
Fortz et al. Polyhedral approaches to the design of survivable networks
Cancela et al. Network design with node connectivity constraints