Skip to content
VuFind
Advanced
  • Addressing the most reliable e...
  • Cite this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
Addressing the most reliable edge-disjoint paths with a delay constraint
QR Code

Addressing the most reliable edge-disjoint paths with a delay constraint

Bibliographic Details
Main Authors: Loh, Rue-chze, Soh, Sie Teng, Lazarescu, Mihai
Format: Journal Article
Published: IEEE 2011
Subjects:
network reliability
multi-constrained edge-disjoint paths
network delay
lagrange relaxation
approximate algorithm
Online Access:http://hdl.handle.net/20.500.11937/49558
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

http://hdl.handle.net/20.500.11937/49558

Similar Items

  • Edge disjoint paths with minimum delay subject to reliability constraint
    by: Loh, Rue-chze, et al.
    Published: (2009)
  • Maximizing bandwidth using disjoint paths
    by: Loh, R., et al.
    Published: (2010)
  • Using edge-disjoint paths to improve the QoS in computer communications
    by: Loh, Ruen Chze
    Published: (2010)
  • Energy Aware Two Disjoint Paths Routing
    by: Lin, GongQi, et al.
    Published: (2014)
  • Bi-Objective Topology Design of Communication Networks Using Dynamic Programming
    by: Elshqeirat, Basima, et al.
    Published: (2015)

Search Options

  • Advanced Search

Find More

  • Browse the Catalog

Need Help?

  • Search Tips