[go: up one dir, main page]

Bhandari, 1997 - Google Patents

Optimal physical diversity algorithms and survivable networks

Bhandari, 1997

View PDF
Document ID
10345784546680900444
Author
Bhandari R
Publication year
Publication venue
Proceedings Second IEEE Symposium on Computer and Communications

External Links

Snippet

One way to improve the reliability of a network is through physical diversity, ie, via routing of traffic between a given pair of nodes in the network over two or more physically-disjoint paths such that if a node or a physical link fails on one of the disjoint paths, not all of the …
Continue reading at www.drrameshbhandari.net (PDF) (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/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
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/22—Alternate 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/128—Shortest path evaluation for finding disjoint paths
    • H04L45/1283—Shortest path evaluation for finding disjoint paths with disjoint links
    • 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
    • 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
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • 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
    • 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
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13352—Self-routing networks, real-time 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/5619—Network Node Interface, e.g. tandem connections, transit switching

Similar Documents

Publication Publication Date Title
Bhandari Optimal physical diversity algorithms and survivable networks
Coan et al. Using distributed topology update and preplanned configurations to achieve trunk network survivability
US6047331A (en) Method and apparatus for automatic protection switching
Mohan et al. Efficient algorithms for routing dependable connections in WDM optical networks
US5459716A (en) Facility restoration for telecommunications networks
Dunn et al. Comparison of k-shortest paths and maximum flow routing for network facility restoration
US7133359B2 (en) Fast restoration mechanism and method of determining minimum restoration capacity in a transmission networks
US5646936A (en) Knowledge based path set up and spare capacity assignment for distributed network restoration
Bhandari Survivable networks: algorithms for diverse routing
US7362974B2 (en) Method for planning or provisioning data transport networks
Murakami et al. Comparative study on restoration schemes of survivable ATM networks
US5787271A (en) Spare capacity allocation tool
Choi et al. Loopback recovery from double-link failures in optical mesh networks
US20050237950A1 (en) System, method and apparatus for dynamic path protection in networks
Li et al. Fiber span failure protection in mesh optical networks
Datta et al. Diverse routing for shared risk resource groups (SRRG) failures in WDM optical networks
Kennington et al. Wavelength routing and assignment in a survivable WDM mesh network
Luss et al. Topological network design for SONET ring architecture
Wilson The quantitative impact of survivable network architectures on service availability
Ríos et al. Survivable capacitated network design problem: new formulation and Lagrangean relaxation
US8774627B2 (en) Network restoration under link or node failure using preconfigured virtual cycles
US20030009598A1 (en) Method for designing demand-sensitive rings
Karasan et al. Design of translucent optical networks: Partitioning and restoration
Ho et al. Spare capacity allocation for WDM mesh networks with partial wavelength conversion capacity
US6772102B1 (en) Optimal placement of wavelength converters in trees and trees of rings