Efficient routing and scheduling algorithms for optical networks

Alok Aggarwal; Amotz Bar-Noy; Don Coppersmith; Rajiv Ramaswami; Baruch Schieber; Madhu Sudan

Efficient routing and scheduling algorithms for optical networks

Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan

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

Abstract

This paper studies the problems of dedicating routes and scheduling transmissions in optical networks. In optical networks, the vast bandwidth available in an optical fiber is utilized by partitioning it into several channels, each at a different optical wavelength. A connection between two nodes is assigned a specific wavelength, with the constraint that no two connections sharing a link in the network can be assigned the same wavelength. This paper classifies several models related to optical networks and presents optimal or near-optimal algorithms for permutation routing and/or scheduling problems in many of these models.

Original language	English (US)
Title of host publication	Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms
Publisher	Publ by ACM
Pages	412-423
Number of pages	12
ISBN (Print)	0898713293
State	Published - 1994
Externally published	Yes
Event	Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms - Arlington, VA, USA Duration: Jan 23 1994 → Jan 25 1994

Publication series

Name	Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

Conference

Conference	Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms
City	Arlington, VA, USA
Period	1/23/94 → 1/25/94

All Science Journal Classification (ASJC) codes

Software
General Mathematics

Cite this

@inproceedings{0ef24f3fa1364baeb1d9d7a79caee617,

title = "Efficient routing and scheduling algorithms for optical networks",

abstract = "This paper studies the problems of dedicating routes and scheduling transmissions in optical networks. In optical networks, the vast bandwidth available in an optical fiber is utilized by partitioning it into several channels, each at a different optical wavelength. A connection between two nodes is assigned a specific wavelength, with the constraint that no two connections sharing a link in the network can be assigned the same wavelength. This paper classifies several models related to optical networks and presents optimal or near-optimal algorithms for permutation routing and/or scheduling problems in many of these models.",

author = "Alok Aggarwal and Amotz Bar-Noy and Don Coppersmith and Rajiv Ramaswami and Baruch Schieber and Madhu Sudan",

year = "1994",

language = "English (US)",

isbn = "0898713293",

series = "Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms",

publisher = "Publ by ACM",

pages = "412--423",

booktitle = "Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms",

note = "Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms ; Conference date: 23-01-1994 Through 25-01-1994",

}

Aggarwal, A, Bar-Noy, A, Coppersmith, D, Ramaswami, R, Schieber, B & Sudan, M 1994, Efficient routing and scheduling algorithms for optical networks. in Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, Publ by ACM, pp. 412-423, Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms, Arlington, VA, USA, 1/23/94.

Efficient routing and scheduling algorithms for optical networks. / Aggarwal, Alok; Bar-Noy, Amotz; Coppersmith, Don et al.
Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Publ by ACM, 1994. p. 412-423 (Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms).

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

TY - GEN

T1 - Efficient routing and scheduling algorithms for optical networks

AU - Aggarwal, Alok

AU - Bar-Noy, Amotz

AU - Coppersmith, Don

AU - Ramaswami, Rajiv

AU - Schieber, Baruch

AU - Sudan, Madhu

PY - 1994

Y1 - 1994

N2 - This paper studies the problems of dedicating routes and scheduling transmissions in optical networks. In optical networks, the vast bandwidth available in an optical fiber is utilized by partitioning it into several channels, each at a different optical wavelength. A connection between two nodes is assigned a specific wavelength, with the constraint that no two connections sharing a link in the network can be assigned the same wavelength. This paper classifies several models related to optical networks and presents optimal or near-optimal algorithms for permutation routing and/or scheduling problems in many of these models.

AB - This paper studies the problems of dedicating routes and scheduling transmissions in optical networks. In optical networks, the vast bandwidth available in an optical fiber is utilized by partitioning it into several channels, each at a different optical wavelength. A connection between two nodes is assigned a specific wavelength, with the constraint that no two connections sharing a link in the network can be assigned the same wavelength. This paper classifies several models related to optical networks and presents optimal or near-optimal algorithms for permutation routing and/or scheduling problems in many of these models.

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

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

M3 - Conference contribution

AN - SCOPUS:0028317867

SN - 0898713293

T3 - Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

SP - 412

EP - 423

BT - Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

PB - Publ by ACM

T2 - Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms

Y2 - 23 January 1994 through 25 January 1994

ER -

Efficient routing and scheduling algorithms for optical networks

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this