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: Chapter in Book/Report/Conference proceeding › Conference contribution › 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
Title of host publication	Optical Fiber Communication Conference, OFC 2004 - Postconference Digest
Pages	119-121
Number of pages	3
State	Published - 2004
Event	Optical Fiber Communication Conference, OFC 2004 - Los Angeles, CA, United States Duration: Feb 23 2004 → Feb 27 2004

Publication series

Name	Conference on Optical Fiber Communication, Technical Digest Series
Volume	2

Conference

Conference	Optical Fiber Communication Conference, OFC 2004
Country/Territory	United States
City	Los Angeles, CA
Period	02/23/04 → 02/27/04

Cite this

@inproceedings{149e692faca24c6fab658cf90244bbf8,

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",

isbn = "1557527725",

series = "Conference on Optical Fiber Communication, Technical Digest Series",

pages = "119--121",

booktitle = "Optical Fiber Communication Conference, OFC 2004 - Postconference Digest",

note = "Optical Fiber Communication Conference, OFC 2004 ; Conference date: 23-02-2004 Through 27-02-2004",

}

Xu, D, Chen, Y & Qiao, C 2004, A new heuristic for finding the shortest path with a disjoint counterpart. in Optical Fiber Communication Conference, OFC 2004 - Postconference Digest., 1362091, Conference on Optical Fiber Communication, Technical Digest Series, vol. 2, pp. 119-121, Optical Fiber Communication Conference, OFC 2004, Los Angeles, CA, United States, 02/23/04.

A new heuristic for finding the shortest path with a disjoint counterpart. / Xu, Dahai; Chen, Yang; Qiao, Chunming.
Optical Fiber Communication Conference, OFC 2004 - Postconference Digest. 2004. p. 119-121 1362091 (Conference on Optical Fiber Communication, Technical Digest Series; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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/84866063793

M3 - Conference contribution

AN - SCOPUS:84866063793

SN - 1557527725

SN - 9781557527721

T3 - Conference on Optical Fiber Communication, Technical Digest Series

SP - 119

EP - 121

BT - Optical Fiber Communication Conference, OFC 2004 - Postconference Digest

T2 - Optical Fiber Communication Conference, OFC 2004

Y2 - 23 February 2004 through 27 February 2004

ER -

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

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this