Optimized partitioning of a wavelength distributed data interface ring network

A fiber optic ring network, such as fiber distributed data interface (FDDI), can be operated over multiple wavelengths on its existing fiber plant consisting of point-to-point fiber links. Using wavelength division multiplexing (WDM) technology, FDDI nodes can be partitioned to operate over multiple subnetworks, with each subnetwork operating independently on a different wavelength, and inter-subnetwork traffic forwarding performed by a bridge. For this multiwavelength version of FDDI, which we refer to as wavelength distributed data interface (WDDI), we examine the necessary upgrades to the architecture of a FDDI node, including its possibility to serve as a bridge. The main motivation behind this study is that, as network traffic scales beyond (the single-wavelength) FDDI's information-carrying capacity, its multiwavelength version, WDDI, can gracefully accommodate such traffic growth. A number of design choices exist in constructing a good WDDI network. Specifically, we investigate algorithms using which, based on prevailing traffic conditions, partitioning of nodes into subnetworks can be performed in an optimized fashion. Our algorithms partition the nodes into subrings, such that the total traffic flow in the network and/or the network-wide average packet delay is minimized. >

[1]  R. Ramaswami,et al.  Multiwavelength lightwave networks for computer communication , 1993, IEEE Communications Magazine.

[2]  A. Elrefaie Multiwavelength survivable ring network architectures , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[3]  A.S. Acampora,et al.  An overview of lightwave packet networks , 1989, IEEE Network.

[4]  B. Mukherjee,et al.  WDM-based local lightwave networks. II. Multihop systems , 1992, IEEE Network.

[5]  A. F. Elrefaie Self-healing WDM ring networks with all-optical protection path , 1992 .

[6]  Charles A. Brackett,et al.  Dense Wavelength Division Multiplexing Networks: Principles and Applications , 1990, IEEE J. Sel. Areas Commun..

[7]  Dorit S. Hochbaum,et al.  Polynomial algorithm for the k-cut problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[8]  Paul E. Green,et al.  The future of fiber-optic computer networks , 1991, Computer.

[9]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[10]  Laura A. Sanchis,et al.  Multiple-Way Network Partitioning , 1989, IEEE Trans. Computers.

[11]  Biswanath Mukherjee,et al.  Wavelength-distributed data-interface network , 1994 .

[12]  Biswanath Mukherjee,et al.  Multiple-partition token ring network , 1991, Comput. Commun..

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  T. E. Chapuran,et al.  Multiwavelength ring networks for switch consolidation and interconnection , 1992, [Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications.

[15]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[16]  R. H. Cardwell,et al.  High-speed self-healing ring architectures for future interoffice networks , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[17]  Arif Merchant,et al.  Multiway graph partitioning with applications to PCS networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[18]  B. Mukherjee,et al.  WDM-based local lightwave networks. I. Single-hop systems , 1992, IEEE Network.

[19]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..