Loading [MathJax]/extensions/MathZoom.js
Toward using the network as a switch: on the use of TDM in linear optical networks | IEEE Journals & Magazine | IEEE Xplore

Toward using the network as a switch: on the use of TDM in linear optical networks


Abstract:

A common problem in optical networking is that the large quantity of raw bandwidth available in such networks is often difficult to access. We show that time-division mul...Show More

Abstract:

A common problem in optical networking is that the large quantity of raw bandwidth available in such networks is often difficult to access. We show that time-division multiplexing (TDM) can be used to operate bus and ring architectures in a manner akin to a switch. Doing so substantially reduces the amount of hardware [particularly, add-drop multiplexers (ADMs)] needed to utilize fully the available bandwidth in a range of optical networks. We show that a significant fraction (and in some cases all) of the bandwidth available to the system can be utilized even if each node in the system has only a single ADM. Our approach is probabilistic in nature, using generalizations of the Birkhoff-von Neumann statistical multiplexing approaches that have been successful in switching theory. Our techniques rely on decompositions of fractional matchings (for architectures without erasures) and fractional interval graph colorings (for architectures with erasures) into integral matchings and colorings.
Published in: IEEE Journal on Selected Areas in Communications ( Volume: 23, Issue: 8, August 2005)
Page(s): 1533 - 1541
Date of Publication: 01 August 2005

ISSN Information:

References is not available for this document.

I. Introduction

Optical networks using wavelength-division multiplexing (WDM) provide large capacity, but providing access to that capacity in a way that is simple enough to be economical is challenging. In particular, the large quantity of aggregate capacity available in such networks is often inaccessible owing to constraints imposed by interactions among optical fibers, wavelengths on these fibers, electronic routers, and add-drop multiplexers (ADMs). This problem impacts both the design of optical networks (to make good use of their raw bandwidth) and the algorithms for fitting offered traffic into the network. For example, a particular placement of traffic on wavelengths that respects the (electrical) bandwidth at each given node may nevertheless be infeasible if the traffic destined for a node is spread out over more wavelengths than the node has wavelength ADMs.

In this paper, we consider an ADM to comprise single wavelength-tunable receiver/transmitter (transceiver) pair along with the attending equipment, such as filters, to access the fiber. As we discuss in Section III-A, the transmitter or receiver may under certain conditions be constrained to a single wavelength without any loss in performance.

Select All
1.
R. A. Barry, V. W. S. Chan, K. L. Hall, E. S. Kintzer, J. D. Moores, K. A. Rauschenbach, et al., "All-optical network consortium-ultrafast TDM networks", IEEE J. Sel. Areas Commun., vol. 14, pp. 999-1013, Jun. 1996.
2.
G. Birkhoff, Three Observations on Linear Algebra, Argentina, Tucumán:Universidad Nacional Tucumán, 1946.
3.
C. Bisdikian, "Waiting time analysis in a single buffer DQDB (802.6) network", Proc. IEEE INFOCOM, pp. 610-616, 1990.
4.
R. Berry and E. Modiano, "Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic", IEEE J. Sel. Areas Commun., Oct. 2000.
5.
D. J. Blumenthal, B.-E. Olsson, G. Rossi, T. E. Dimmick, L. Rau, M. Masanovic, et al., "All-optical label swapping networks and technologies", IEEE J. Lightw. Commun., vol. 18, no. 12, pp. 2058-2075, Dec. 2000.
6.
C.-S. Chang, W. J. Chen and H.-Y. Huang, "Birkhoff-von Neumann input buffered crossbar switches", Proc. IEEE INFOCOM, vol. 3, pp. 1614-1623, 2000.
7.
C.-S. Chang, W. J. Chen and H.-Y. Huang, "Birkhoff-von Neumann input-buffered crossbar switches for guaranteed-rate services", IEEE Trans. Commun., vol. 49, pp. 1145-1147, 2001.
8.
M. Conti, E. Gregori and L. Lenzini, "DQDB under heavy load: Performance evaluation and fairness analysis", Proc. IEEE INFOCOM, pp. 133-145, 1990.
9.
M. Conti, E. Gregori and L. Lenzini, "A methodological approach to an extensive analysis of DQDB performance and fairness", IEEE J. Sel. Areas Commun., vol. 9, pp. 76-87, Jan. 1991.
10.
T. Y. Chow and P. Lin, "The ring grooming problem", SIAM J. Discrete Math., 2001.
11.
C.-S. Chang, D.-S. Lee and Y.-S. Jou, "Load balanced Birkhoff-von Neumann switches", Proc. IEEE Workshop High-Performance Switching Routing, pp. 276-280, 2001.
12.
W. Cho, J. Wang and B. Mukherjee, "Improved approaches for cost-effective grooming in WDM ring networks: Uniform traffic case", Photonic Netw. Commun., vol. 3, no. 2, pp. 245-254, Apr. 2001.
13.
R. Dutta and G. N. Rouskas, "On optimal traffic grooming in WDM rings", IEEE J. Sel. Areas Commun., vol. 20, pp. 110-121, Jan. 2002.
14.
S. G. Finn, "HLAN An architecture for optical multiaccess networks", Proc. Digest LEOS Summer Topical Meetings, pp. 45-46, 1995.
15.
L. M. Gardner, M. Heydri, J. Shah, I. H. Sudborough, I. G. Trollis and C. Xia, "Techniques for finding ring covers in survivable networks", Proc. GLOBECOM, vol. 3, 1994.
16.
U. I. Gupta, D. T. Lee and Y. Y.-T. Leung, "Efficient algorithms for interval graphs and circular-arc graphs", Networks, vol. 12, pp. 459-467, 1982.
17.
O. Gerstel, R. Ramaswami and G. Sasaki, "Cost effective traffic grooming in WDM rings", IEEE/ACM Trans. Netw., vol. 8, pp. 618-630, Oct. 2000.
18.
M. Grötschel and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Germany, Berlin:Springer-Verlag, vol. 2, 1988.
19.
H. Ghafouri-Shiraz, G. Zhu and Y. Fei, "Effective wavelength assignment algorithms for optimizing design in SONET/WDM rings", IEEE J. Lightw. Commun., vol. 19, no. 10, pp. 1427-1439, Oct. 2001.
20.
M. Hamdi, "ORMA: A high-performance MAC protocol for fiber-optic LANs/MANs", IEEE Commun. Mag., vol. 35, no. 3, pp. 110-119, Mar. 1997.
21.
E. Y. Huang and L. F. Merakos, "On the access fairness of the DQDB MAN protocol", Proc. IPCC, pp. 325-329, 1990.
22.
E. Y. Huang, "Analysis of cyclic reservation multiple access protocol", Proc. 19th Conf. Local Comput. Netw., pp. 102-107, 1994.
23.
Distributed Queue Dual Bus (DQDB)Subnetwork of a Metropolitan are Network (MAN).
24.
A. E. Kamal, "Efficient multi-segment message transmission with slot reuse on DQDB", Proc. IEEE INFOCOM, pp. 869-878, 1991.
25.
I. A. Karapetian, "On coloring of arc graphs", Dokladi (Reports) Acad. Sci. Armenian Soviet Socialist Republic, vol. 70, no. 5, pp. 306-311, 1980.
26.
V. R. Konda and T. Y. Chow, "Algorithm for traffic grooming in opticaql networks to minimize the number of transceivers", Proc. IEEE Workshop High-Performance Switching Routing, pp. 218-221, 2001.
27.
J. Li and N. Ansari, "Enhanced Birkhoff-von Neumann decomposition algorithm for input queued switches", Proc. IEE Commun., vol. 148, no. 6, pp. 339-342, 2001.
28.
J. Li and N. Ansari, "QoS guaranteed input scheduled algorithms with low delay", Proc. IEEE Workshop High-Performance Switching Routing, pp. 412-414, 2001.
29.
A. Libarikian and M. Médard, "Robustness of bus overlays in optical networks", Proc. 39th Annu. Allerton Conf. Commun. Control Comput., pp. 633-645, 2001.
30.
X. Y. Li, P. J. Wan and L. Liu, "Select line speeds for single-hub SONET/WDM ring networks", Proc. IEEE Int. Conf. Commun., vol. 1, pp. 495-499, 2000.
Contact IEEE to Subscribe

References

References is not available for this document.