gStreams: A new technique for fast recovery with capacity efficient protection in WDM mesh networks

Arunabha Sen, Sudheendra Murthy, Subir Bandyopadyay

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

In a recent paper, Kim and Lumetta [6] proposed a capacity efficient protection scheme that provides fast recovery in WDM mesh networks. They introduced the notion of a stream that is utilized for this purpose. In this paper, we introduce the concept of gStream, which is a more generalized form of stream and develop efficient algorithms for maximizing capacity utilization without sacrificing the benefit of fast recovery. We show that the problem of finding the set of gStreams that maximizes capacity utilization is NP-complete. We present (i) an optimal solution for formation of streams and gStreams and (ii) a heuristic solution. The results of our experimental evaluation show that our heuristic provides near optimal solution to almost all instances of the problem in a fraction of the time needed for finding the optimal solution.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Pages2211-2217
Number of pages7
DOIs
StatePublished - 2007
Event2007 IEEE International Conference on Communications, ICC'07 - Glasgow, Scotland, United Kingdom
Duration: Jun 24 2007Jun 28 2007

Other

Other2007 IEEE International Conference on Communications, ICC'07
CountryUnited Kingdom
CityGlasgow, Scotland
Period6/24/076/28/07

Fingerprint

Wavelength division multiplexing
Recovery

ASJC Scopus subject areas

  • Media Technology

Cite this

Sen, A., Murthy, S., & Bandyopadyay, S. (2007). gStreams: A new technique for fast recovery with capacity efficient protection in WDM mesh networks. In IEEE International Conference on Communications (pp. 2211-2217). [4289043] https://doi.org/10.1109/ICC.2007.372

gStreams : A new technique for fast recovery with capacity efficient protection in WDM mesh networks. / Sen, Arunabha; Murthy, Sudheendra; Bandyopadyay, Subir.

IEEE International Conference on Communications. 2007. p. 2211-2217 4289043.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sen, A, Murthy, S & Bandyopadyay, S 2007, gStreams: A new technique for fast recovery with capacity efficient protection in WDM mesh networks. in IEEE International Conference on Communications., 4289043, pp. 2211-2217, 2007 IEEE International Conference on Communications, ICC'07, Glasgow, Scotland, United Kingdom, 6/24/07. https://doi.org/10.1109/ICC.2007.372
Sen A, Murthy S, Bandyopadyay S. gStreams: A new technique for fast recovery with capacity efficient protection in WDM mesh networks. In IEEE International Conference on Communications. 2007. p. 2211-2217. 4289043 https://doi.org/10.1109/ICC.2007.372
Sen, Arunabha ; Murthy, Sudheendra ; Bandyopadyay, Subir. / gStreams : A new technique for fast recovery with capacity efficient protection in WDM mesh networks. IEEE International Conference on Communications. 2007. pp. 2211-2217
@inproceedings{68bc8d11b80944c394a8d7c1bf383f51,
title = "gStreams: A new technique for fast recovery with capacity efficient protection in WDM mesh networks",
abstract = "In a recent paper, Kim and Lumetta [6] proposed a capacity efficient protection scheme that provides fast recovery in WDM mesh networks. They introduced the notion of a stream that is utilized for this purpose. In this paper, we introduce the concept of gStream, which is a more generalized form of stream and develop efficient algorithms for maximizing capacity utilization without sacrificing the benefit of fast recovery. We show that the problem of finding the set of gStreams that maximizes capacity utilization is NP-complete. We present (i) an optimal solution for formation of streams and gStreams and (ii) a heuristic solution. The results of our experimental evaluation show that our heuristic provides near optimal solution to almost all instances of the problem in a fraction of the time needed for finding the optimal solution.",
author = "Arunabha Sen and Sudheendra Murthy and Subir Bandyopadyay",
year = "2007",
doi = "10.1109/ICC.2007.372",
language = "English (US)",
isbn = "1424403537",
pages = "2211--2217",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - gStreams

T2 - A new technique for fast recovery with capacity efficient protection in WDM mesh networks

AU - Sen, Arunabha

AU - Murthy, Sudheendra

AU - Bandyopadyay, Subir

PY - 2007

Y1 - 2007

N2 - In a recent paper, Kim and Lumetta [6] proposed a capacity efficient protection scheme that provides fast recovery in WDM mesh networks. They introduced the notion of a stream that is utilized for this purpose. In this paper, we introduce the concept of gStream, which is a more generalized form of stream and develop efficient algorithms for maximizing capacity utilization without sacrificing the benefit of fast recovery. We show that the problem of finding the set of gStreams that maximizes capacity utilization is NP-complete. We present (i) an optimal solution for formation of streams and gStreams and (ii) a heuristic solution. The results of our experimental evaluation show that our heuristic provides near optimal solution to almost all instances of the problem in a fraction of the time needed for finding the optimal solution.

AB - In a recent paper, Kim and Lumetta [6] proposed a capacity efficient protection scheme that provides fast recovery in WDM mesh networks. They introduced the notion of a stream that is utilized for this purpose. In this paper, we introduce the concept of gStream, which is a more generalized form of stream and develop efficient algorithms for maximizing capacity utilization without sacrificing the benefit of fast recovery. We show that the problem of finding the set of gStreams that maximizes capacity utilization is NP-complete. We present (i) an optimal solution for formation of streams and gStreams and (ii) a heuristic solution. The results of our experimental evaluation show that our heuristic provides near optimal solution to almost all instances of the problem in a fraction of the time needed for finding the optimal solution.

UR - http://www.scopus.com/inward/record.url?scp=38549154717&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38549154717&partnerID=8YFLogxK

U2 - 10.1109/ICC.2007.372

DO - 10.1109/ICC.2007.372

M3 - Conference contribution

AN - SCOPUS:38549154717

SN - 1424403537

SN - 9781424403530

SP - 2211

EP - 2217

BT - IEEE International Conference on Communications

ER -