A new heuristic for finding the shortest path with a disjoint counterpart

Dahai Xu; Yang Chen; Chunming Qiao

A new heuristic for finding the shortest path with a disjoint counterpart

Dahai Xu
, Yang Chen
, Chunming Qiao

Department of Computer Science and Engineering

SUNY Buffalo

Research output: Contribution to journal › Conference article › peer-review

1 Scopus citations

Abstract

We describe a new heuristic for finding a shortest active path with a disjoint backup path (the Min-Min problem), which works better than other heuristics and is also a viable approach for shared path protection.

Original language	English
Pages (from-to)	119-121
Number of pages	3
Journal	OSA Trends in Optics and Photonics Series
Volume	95 B
State	Published - 2004
Event	Optical Fiber Communucation Conference (OFC), Postconference Digest - Washington, DC, United States Duration: Feb 26 2004 → Feb 27 2004

Cite this

@article{f1e12488775749de93bd1da332fd44ed,

title = "A new heuristic for finding the shortest path with a disjoint counterpart",

abstract = "We describe a new heuristic for finding a shortest active path with a disjoint backup path (the Min-Min problem), which works better than other heuristics and is also a viable approach for shared path protection.",

author = "Dahai Xu and Yang Chen and Chunming Qiao",

year = "2004",

language = "English",

volume = "95 B",

pages = "119--121",

journal = "OSA Trends in Optics and Photonics Series",

issn = "1094-5695",

note = "Optical Fiber Communucation Conference (OFC), Postconference Digest ; Conference date: 26-02-2004 Through 27-02-2004",

}

TY - JOUR

T1 - A new heuristic for finding the shortest path with a disjoint counterpart

AU - Xu, Dahai

AU - Chen, Yang

AU - Qiao, Chunming

PY - 2004

Y1 - 2004

N2 - We describe a new heuristic for finding a shortest active path with a disjoint backup path (the Min-Min problem), which works better than other heuristics and is also a viable approach for shared path protection.

AB - We describe a new heuristic for finding a shortest active path with a disjoint backup path (the Min-Min problem), which works better than other heuristics and is also a viable approach for shared path protection.

UR - https://www.scopus.com/pages/publications/8744220390

M3 - Conference article

AN - SCOPUS:8744220390

SN - 1094-5695

VL - 95 B

SP - 119

EP - 121

JO - OSA Trends in Optics and Photonics Series

JF - OSA Trends in Optics and Photonics Series

T2 - Optical Fiber Communucation Conference (OFC), Postconference Digest

Y2 - 26 February 2004 through 27 February 2004

ER -

A new heuristic for finding the shortest path with a disjoint counterpart

Abstract

Other files and links

Fingerprint

Cite this