Minimizing electronic multiplexing costs for dynamic traffic in unidirectional SONET ring networks

Randall A Berry; E. Modiano

doi:10.1109/ICC.1999.765535

Minimizing electronic multiplexing costs for dynamic traffic in unidirectional SONET ring networks

Randall A Berry, E. Modiano

Electrical and Computer Engineering

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

7 Scopus citations

Abstract

In this paper we consider the circuit assignment algorithm for dynamic traffic in unidirectional WDM/SONET ring networks. Our objective is to minimize the cost of electronic add/drop multiplexers (ADMs) in the network, while being able to support any offered traffic matrix in a rearrangeably non-blocking manner. The only restriction on the offered traffic is a constraint on the number of circuits a node may source at any given time. We provide a lower bound on the number of ADMs required and give conditions that a network must satisfy in order for it to support the desired set of traffic patterns. Circuit assignment and ADM placement algorithms that perform closely to this lower bound are provided. These algorithms are shown to reduce the electronic costs of a network by over 30%. Finally, we discuss extensions of this work for supporting dynamic traffic in a wide-sense or strict sense non-blocking manner as well as the benefits of using a hub node and tunable transceivers.

Original language	English (US)
Title of host publication	1999 IEEE International Conference on Communications, ICC 1999
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1724-1730
Number of pages	7
Volume	3
ISBN (Electronic)	078035284X
DOIs	https://doi.org/10.1109/ICC.1999.765535
State	Published - Jan 1 1999
Event	1999 IEEE International Conference on Communications, ICC 1999 - Vancouver, Canada Duration: Jun 6 1999 → Jun 10 1999

Other

Other	1999 IEEE International Conference on Communications, ICC 1999
Country	Canada
City	Vancouver
Period	6/6/99 → 6/10/99

ASJC Scopus subject areas

Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/ICC.1999.765535

Fingerprint Dive into the research topics of 'Minimizing electronic multiplexing costs for dynamic traffic in unidirectional SONET ring networks'. Together they form a unique fingerprint.

Cite this

@inproceedings{bbce140704614c0b86ddb9da28af190e,

title = "Minimizing electronic multiplexing costs for dynamic traffic in unidirectional SONET ring networks",

abstract = "In this paper we consider the circuit assignment algorithm for dynamic traffic in unidirectional WDM/SONET ring networks. Our objective is to minimize the cost of electronic add/drop multiplexers (ADMs) in the network, while being able to support any offered traffic matrix in a rearrangeably non-blocking manner. The only restriction on the offered traffic is a constraint on the number of circuits a node may source at any given time. We provide a lower bound on the number of ADMs required and give conditions that a network must satisfy in order for it to support the desired set of traffic patterns. Circuit assignment and ADM placement algorithms that perform closely to this lower bound are provided. These algorithms are shown to reduce the electronic costs of a network by over 30%. Finally, we discuss extensions of this work for supporting dynamic traffic in a wide-sense or strict sense non-blocking manner as well as the benefits of using a hub node and tunable transceivers.",

author = "Berry, {Randall A} and E. Modiano",

year = "1999",

month = jan,

day = "1",

doi = "10.1109/ICC.1999.765535",

language = "English (US)",

volume = "3",

pages = "1724--1730",

booktitle = "1999 IEEE International Conference on Communications, ICC 1999",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "1999 IEEE International Conference on Communications, ICC 1999 ; Conference date: 06-06-1999 Through 10-06-1999",

}

Berry, RA & Modiano, E 1999, Minimizing electronic multiplexing costs for dynamic traffic in unidirectional SONET ring networks. in 1999 IEEE International Conference on Communications, ICC 1999. vol. 3, 765535, Institute of Electrical and Electronics Engineers Inc., pp. 1724-1730, 1999 IEEE International Conference on Communications, ICC 1999, Vancouver, Canada, 6/6/99. https://doi.org/10.1109/ICC.1999.765535

Minimizing electronic multiplexing costs for dynamic traffic in unidirectional SONET ring networks. / Berry, Randall A; Modiano, E.

1999 IEEE International Conference on Communications, ICC 1999. Vol. 3 Institute of Electrical and Electronics Engineers Inc., 1999. p. 1724-1730 765535.

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

TY - GEN

T1 - Minimizing electronic multiplexing costs for dynamic traffic in unidirectional SONET ring networks

AU - Berry, Randall A

AU - Modiano, E.

PY - 1999/1/1

Y1 - 1999/1/1

N2 - In this paper we consider the circuit assignment algorithm for dynamic traffic in unidirectional WDM/SONET ring networks. Our objective is to minimize the cost of electronic add/drop multiplexers (ADMs) in the network, while being able to support any offered traffic matrix in a rearrangeably non-blocking manner. The only restriction on the offered traffic is a constraint on the number of circuits a node may source at any given time. We provide a lower bound on the number of ADMs required and give conditions that a network must satisfy in order for it to support the desired set of traffic patterns. Circuit assignment and ADM placement algorithms that perform closely to this lower bound are provided. These algorithms are shown to reduce the electronic costs of a network by over 30%. Finally, we discuss extensions of this work for supporting dynamic traffic in a wide-sense or strict sense non-blocking manner as well as the benefits of using a hub node and tunable transceivers.

AB - In this paper we consider the circuit assignment algorithm for dynamic traffic in unidirectional WDM/SONET ring networks. Our objective is to minimize the cost of electronic add/drop multiplexers (ADMs) in the network, while being able to support any offered traffic matrix in a rearrangeably non-blocking manner. The only restriction on the offered traffic is a constraint on the number of circuits a node may source at any given time. We provide a lower bound on the number of ADMs required and give conditions that a network must satisfy in order for it to support the desired set of traffic patterns. Circuit assignment and ADM placement algorithms that perform closely to this lower bound are provided. These algorithms are shown to reduce the electronic costs of a network by over 30%. Finally, we discuss extensions of this work for supporting dynamic traffic in a wide-sense or strict sense non-blocking manner as well as the benefits of using a hub node and tunable transceivers.

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

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

U2 - 10.1109/ICC.1999.765535

DO - 10.1109/ICC.1999.765535

M3 - Conference contribution

AN - SCOPUS:84926122268

VL - 3

SP - 1724

EP - 1730

BT - 1999 IEEE International Conference on Communications, ICC 1999

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 1999 IEEE International Conference on Communications, ICC 1999

Y2 - 6 June 1999 through 10 June 1999

ER -