Abstract
Recently, E. Modiano and A. Narula-Tam (see Proc. IEEE INFOCOM'01, 2001) introduced the notion of survivable routing and established a necessary and sufficient condition for the existence of survivable routes for a given logical topology in a physical topology. In two earlier papers, we showed that the survivability problem is NP-complete, both when the nodes of the logical topology are unlabeled (Sen, A. et al., Proc. IEEE Int. Commun. Conf. ICC'02, 2002) or labeled (Sen et al., Proc. IEEE Int. Symp. on Computers and Commun. ISCC'02, 2002). We also gave algorithms to test if survivable routing of a logical ring is possible in a WDM network with arbitrary physical topology. We now address finding the minimum number of links that have to be added to a physical topology so that the survivable routing of a logical ring is possible. We show that, not only is this problem NP-complete, but an/spl epsiv/-approximation algorithm for the problem cannot be found unless P=NP. We provide an ILP formulation for finding the optimal solution of the problem. We also provide an approximate solution of the problem. The approximate algorithm requires only a very small fraction of the time required by the optimal algorithm, but produces results that are close to the optimal solution on two test networks-ARPANET and the Italian National Network.
| Original language | English (US) |
|---|---|
| Title of host publication | IEEE International Conference on High Performance Switching and Routing, HPSR |
| Publisher | IEEE Computer Society |
| Pages | 183-188 |
| Number of pages | 6 |
| ISBN (Print) | 0780377109, 9780780377103 |
| DOIs | |
| State | Published - 2003 |
| Event | 2003 Workshop on High Performance Switching and Routing, HPSR 2003 - Torino, Italy Duration: Jun 24 2003 → Jun 27 2003 |
Other
| Other | 2003 Workshop on High Performance Switching and Routing, HPSR 2003 |
|---|---|
| Country | Italy |
| City | Torino |
| Period | 6/24/03 → 6/27/03 |
Fingerprint
Keywords
- fault tolerance
- Integer Linear Programs
- protection path
- trafic class
- WDM networks
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering
Cite this
Minimum cost ring survivability in WDM networks. / Shen, Bao Hong; Hao, Bin; Sen, Arunabha.
IEEE International Conference on High Performance Switching and Routing, HPSR. IEEE Computer Society, 2003. p. 183-188 1226702.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Minimum cost ring survivability in WDM networks
AU - Shen, Bao Hong
AU - Hao, Bin
AU - Sen, Arunabha
PY - 2003
Y1 - 2003
N2 - Recently, E. Modiano and A. Narula-Tam (see Proc. IEEE INFOCOM'01, 2001) introduced the notion of survivable routing and established a necessary and sufficient condition for the existence of survivable routes for a given logical topology in a physical topology. In two earlier papers, we showed that the survivability problem is NP-complete, both when the nodes of the logical topology are unlabeled (Sen, A. et al., Proc. IEEE Int. Commun. Conf. ICC'02, 2002) or labeled (Sen et al., Proc. IEEE Int. Symp. on Computers and Commun. ISCC'02, 2002). We also gave algorithms to test if survivable routing of a logical ring is possible in a WDM network with arbitrary physical topology. We now address finding the minimum number of links that have to be added to a physical topology so that the survivable routing of a logical ring is possible. We show that, not only is this problem NP-complete, but an/spl epsiv/-approximation algorithm for the problem cannot be found unless P=NP. We provide an ILP formulation for finding the optimal solution of the problem. We also provide an approximate solution of the problem. The approximate algorithm requires only a very small fraction of the time required by the optimal algorithm, but produces results that are close to the optimal solution on two test networks-ARPANET and the Italian National Network.
AB - Recently, E. Modiano and A. Narula-Tam (see Proc. IEEE INFOCOM'01, 2001) introduced the notion of survivable routing and established a necessary and sufficient condition for the existence of survivable routes for a given logical topology in a physical topology. In two earlier papers, we showed that the survivability problem is NP-complete, both when the nodes of the logical topology are unlabeled (Sen, A. et al., Proc. IEEE Int. Commun. Conf. ICC'02, 2002) or labeled (Sen et al., Proc. IEEE Int. Symp. on Computers and Commun. ISCC'02, 2002). We also gave algorithms to test if survivable routing of a logical ring is possible in a WDM network with arbitrary physical topology. We now address finding the minimum number of links that have to be added to a physical topology so that the survivable routing of a logical ring is possible. We show that, not only is this problem NP-complete, but an/spl epsiv/-approximation algorithm for the problem cannot be found unless P=NP. We provide an ILP formulation for finding the optimal solution of the problem. We also provide an approximate solution of the problem. The approximate algorithm requires only a very small fraction of the time required by the optimal algorithm, but produces results that are close to the optimal solution on two test networks-ARPANET and the Italian National Network.
KW - fault tolerance
KW - Integer Linear Programs
KW - protection path
KW - trafic class
KW - WDM networks
UR - http://www.scopus.com/inward/record.url?scp=84905394786&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84905394786&partnerID=8YFLogxK
U2 - 10.1109/HPSR.2003.1226702
DO - 10.1109/HPSR.2003.1226702
M3 - Conference contribution
AN - SCOPUS:84905394786
SN - 0780377109
SN - 9780780377103
SP - 183
EP - 188
BT - IEEE International Conference on High Performance Switching and Routing, HPSR
PB - IEEE Computer Society
ER -