[go: up one dir, main page]

Peng et al., 2007 - Google Patents

A new approximation algorithm for computing 2-restricted disjoint paths

Peng et al., 2007

View PDF
Document ID
16776598618854993501
Author
Peng C
Shen H
Publication year
Publication venue
IEICE transactions on information and systems

External Links

Snippet

In this paper we study the problem of how to identify multiple disjoint paths that have the minimum total cost OPT and satisfy a delay bound D in a graph G. This problem has lots of applications in networking such as fault-tolerant quality of service (QoS) routing and network …
Continue reading at www.jaist.ac.jp (PDF) (other versions)

Classifications

    • 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
    • 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/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
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • 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
    • H04L43/00—Arrangements for monitoring or testing packet switching networks
    • H04L43/08—Monitoring based on specific metrics
    • 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/24—Multipath
    • H04L45/245—Link aggregation, e.g. trunking
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/10—Flow control or congestion control
    • H04L47/12—Congestion avoidance or recovery
    • 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
    • H04L63/00—Network architectures or network communication protocols for network security

Similar Documents

Publication Publication Date Title
Hua et al. Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks
Orda Routing with end-to-end QoS guarantees in broadband networks
US9565102B2 (en) Method and apparatus for determining energy efficient route
CN105553728B (en) A kind of network disaster tolerance recovery system and method based on software defined network technology
Abe et al. k-maximally disjoint path routing algorithms for SDN
Peng et al. A new approximation algorithm for computing 2-restricted disjoint paths
Yin et al. Survivable multipath virtual network embedding against multiple failures for SDN/NFV
Koryachko et al. Adaptive rerouting of data flows in distributed data centers
Fortz et al. Efficient techniques and tools for intra‐domain traffic engineering
Clarke et al. An integrated system for designing minimum cost survivable telecommunications networks
Yan et al. Load balancing routing algorithm among multiple gateways in MANET with Internet connectivity
Walkowiak et al. Algorithms for calculation of candidate trees for efficient multicasting in elastic optical networks
Devetak et al. Minimizing path delay in multipath networks
CN115914891B (en) Data center elastic optical network distance adaptive traffic distribution method and system
Goścień et al. Comparison of different data center location policies in survivable elastic optical networks
Qin et al. Minimum cost multi-path parallel transmission with delay constraint by extending openflow
Murthy et al. Network lifetime analytical model for node-disjoint multipath routing in wireless sensor networks
Ma et al. Enhancing traffic capacity of scale-free networks by employing structural hole theory
Chen et al. On the benefits of multipath routing for distributed data-intensive applications with high bandwidth requirements and multidomain reach
Sen et al. Structural dependency aware service chain mapping for network function virtualization
Chen et al. Information transmission on hybrid networks
Peng et al. An improved approximation algorithm for computing disjoint QoS paths
Loh et al. Maximizing bandwidth using disjoint paths
Li et al. Traffic-Aware Routing Algorithm in Quantum Network
Cheung et al. A new optimization algorithm for power saving in backbone networks