[go: up one dir, main page]

Dunn et al., 1994 - Google Patents

Comparison of k-shortest paths and maximum flow routing for network facility restoration

Dunn et al., 1994

Document ID
10547144620802031421
Author
Dunn D
Grover W
MacGregor M
Publication year
Publication venue
IEEE Journal on selected areas in Communications

External Links

Snippet

In the development of technologies for span failure restoration, a question arises about the restoration rerouting characteristics to be specified. In theory, maximal rerouting capacity is obtained with a maximum flow (Max Flow) criterion. However, rerouting that realizes the k …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/0016—Arrangements providing connection between exchanges
    • H04Q3/0062—Provisions for network management
    • H04Q3/0075—Fault management techniques
    • H04Q3/0079—Fault management techniques involving restoration of networks, e.g. disaster recovery, self-healing networks
    • 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/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J14/00—Optical multiplex systems
    • H04J14/02—Wavelength-division multiplex systems
    • H04J14/0278—WDM optical network architectures
    • H04J14/0284—WDM mesh architectures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/42—Circuit arrangements for indirect selecting controlled by common circuits, e.g. register controller, marker
    • H04Q3/54—Circuit arrangements for indirect selecting controlled by common circuits, e.g. register controller, marker in which the logic circuitry controlling the exchange is centralised
    • 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/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/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/02—Topology update or discovery
    • 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/14—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning
    • H04L41/145—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning involving simulating, designing, planning or modelling of a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J3/00—Time-division multiplex systems
    • H04J3/02—Details
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems

Similar Documents

Publication Publication Date Title
Dunn et al. Comparison of k-shortest paths and maximum flow routing for network facility restoration
Bhandari Optimal physical diversity algorithms and survivable networks
US5546542A (en) Method for efficiently determining the direction for routing a set of anticipated demands between selected nodes on a ring communication network
Gibbens et al. Dynamic routing in fully connected networks
EP0913061B1 (en) Processing data signals
US7466913B2 (en) Method for WDM optical networks including alternate routes for fault recovery
Newport et al. Design of survivable communications networks under performance constraints
US6992988B2 (en) System and method for deadlock-free routing on arbitrary network topologies
CA2206165C (en) Routing in a communication network
Grover Case studies of survivable ring, mesh and mesh-arc hybrid networks
US20030018812A1 (en) Method and apparatus for provisioning working paths in shared protection mesh network
Venables et al. Two strategies for spare capacity placement in mesh restorable networks
Shi et al. Hierarchical self-healing rings
Kim et al. Regenerator placement algorithms for connection establishment in all-optical networks
Carlier et al. Reliability evaluation of large telecommunication networks
Shi et al. Analysis and design of survivable telecommunications networks
White et al. Genetic algorithms and network ring design
Al-Rumaih et al. Spare capacity planning for survivable mesh networks
Balakrishnan et al. Telecommunication link restoration planning with multiple facility types
Clarke et al. An integrated system for designing minimum cost survivable telecommunications networks
Hochbaum et al. The bounded cycle-cover problem
CN113315657B (en) Method and system for analyzing influence of telecommunication transmission network clients based on union collection
Xu et al. On survivable access network design: Complexity and algorithms
Webb et al. Application of genetic algorithm to a network optimisation problem
US6772102B1 (en) Optimal placement of wavelength converters in trees and trees of rings