Abstract
The huge potential of optical networks for satisfying the skyrocketing needs of broadband telecommunication services while meeting rigid quality of service requirements has long been acknowledged. However, although fiber has become the medium of choice in telecommunication networks, its vast resources are severely under-used, due to the much slower electronics that are interfaced with the optical medium. For instance, transceivers operate at speeds that are several orders of magnitude below the actual usable capacity of the fiber (several Gbps versus hundreds of Gbps). In order to achieve higher rates, Wavelength Division Multiplexing (WDM) techniques have been widely suggested. The concept behind WDM is to partition the optical spectrum into multiple non-overlapping wavelength channels, each modulated at electronic speed. WDM networks offer potential advantages, including higher aggregate bandwidth per fiber, new flexibility for automated network management and control, noise immunity, transparency to different data formats and protocols, low bit-error rates, and better network configurability and survivability-all leading to more cost-effective networks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswani, B. Schieber, and M. Sudan, Efficient Routing and Scheduling Algorithms for Optical Networks, Proceedings of the 5th Annual ACM-SAM Symposium on Discrete Algorithms, pp. 412–423, 1994.
S.B. Akers and B. Krishnamurthy, A Group-theoretic Model for Symmetric Interconnection Networks, IEEE Transaction on Computers, Vol. 38, pp. 555–566, 1989.
S.B. Akers, D. Harel and B. Krishnamurthy, The Star Graph: An Attractive Alternative to The n-cube, Proc. Int. Conf. Parallel Processing, pp. 393–400, 1987.
K.A. Aly, Reconfigurable WDM Interconnection of Large-scale Multiprocessor Systems, PhD dissertation, Department of Electrical And Computer Engineering, SUNY at Buffalo, July 1993.
K.A. Aly, P.W. Dowd, A class of Scalable Optical Interconnection Networks through Discrete Broadcast-select Multi-domain WDM, Proc. IEEE INFOCOM’94, (Torando, Canda), June 1994.
Y. Aumann and Y. Rabani, Improved bounds for all optical routing, Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 567–576, San Francisco, California, 22–24 January 1995.
B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi, and A. Rosen. On-line Competitive Algorithms for Call Admission in Optical Networks, Proceedings of the 4th Annual European Symposium on Algorithms, Lecture Notes in Computer Science 1136, pp. 431–444, Springer-Verlag, 1996.
K. Bala and T.E. Stern, Algorithms for Routing in a Linear Lightwave Network, Proceedings of INFOCOM, pp. 1–9, 1991.
R. Ballart and Y.C. Ching, SONET: Now It’s the Standard Optical Network, IEEE Communications Magazine, pp. 8–15, March 1989.
R.A. Barry and P.A. Humblet, Bounds on the Number of Wavelengths Needed in WDM Networks, LEOS’92 Summer Tropical Mtg. Digest, pp. 114–127, 1992.
R.A. Barry and P.A. Humblet, On the Number of Wavelengths and Switches in All Optical Networks, IEEE Transactions on Communications, pp. 583–591, Vol. 42, No. 2/3/4, February/March/April, 1994.
Y. Bartal, A. Fiat, and S. Leonardi, Lower Bounds for On-Line Graph Problems with Application to On-Line Circuit and Optical Routing, Proceedings of the 28th ACM Symposium on Theory of Computing, pp. 531–540, 1996.
Y. Bartal and S. Leonardi. On-Line Routing in All-Optical Networks, Proceedings of the 24th International Colloquium on Automata, Languages and Programming, LNCS 1256, pp. 516–526. Springer-Verlag, 1997.
C.A. Brackett, On the Capacity of Multiwavelength Optical-Star Packet Switches, IEEE Lightwave Magazine, May 1991, pp. 33–37.
N.G. de Bruijn, A Combinatorial Problem, Nederl, Akad. Wetensh. Proc. 49 (1946), pp. 758–764.
W.E. Burr, The FDDI Optical Data Link, IEEE Communications Magazine, Vol.24, No.5, May 1986.
M.S. Chen, N.R. Dono, R. Ramaswami, A Media Access-Protocol for Packet-Switched Wavelength Division Multiaccess Metropolitan Networks, IEEE Journal on Selected Areas in Communications, vol. 8, no. 6, Aug 1990, pp. 1048–1057.
K.W. Cheng, Acousto-optic Tunable Filters in Narrowband WM Networks, IEEE JSAC, 8:10115–1025, 1990.
L Chlamtac and A. Ganz, Toward Alternative High-Speed Network Concepts: The SWIFT Architecture, IEEE Trans. on Communications, vol. 38, no. 4, Apr 1990, pp. 431–439.
P.F. Corbett, Rotator Graphs: AN Efficient Topology for Point-to-Point Multiprocessor Networks, IEEE Transactions on Parallel And Distributed Systems, Vol. 3, No. 5, Sep 1992. pp. 622–626
T. Cox, F. Dix, C. Hemrick and J. McRoberts, SMDS: The Beginning of WAN Superhighways, Data Communications, April 1991.
T.Q. Dam, K.A. Williams, D.H.C. Du, A Media-Access Protocol for Time and Wavelength Division Multiplexed Passive Star Networks, Technical Report 91–63, Computer Science Dept., University of Minnesota.
C. Dragone, Efficient N x N Star Coupler Based on Fourier Optics, Electronics Letters, vol. 24, no. 15, Jul 1988, pp. 942–944.
D.-Z. Du, F. Cao, F. Hsu, de Bruijn Digraph, Kautz Digraph, And Their Generalizations, Combinatorial Network Theory, Du D.-Z., D.F. Hsu eds, Kluwer Academic Publishers, 1995, pp. 65–105.
T. Erlbach, K. Jansen, Scheduling of Virtual Connections in Fast Networks, Proc. of Parallel Systems and Algorithms (PASA) (1996), pp. 13–32.
T. Erlbach, K. Jansen, Call Scheduling in Trees, Rings and Meshes, Proc. of HICSS (1997).
A. Frank, T. Nishizeki, N. Saito, H. Suzuki, E. Tardos, Algorithms for Routing around a Rectangle, Discrete Applied Mathematics 40 (1992), pp. 363–378.
Q.-P. Gu, H. Tamaki, Edge-Disjoint Routing in the Undirected Hypercube. Tech. Rep. COMP 96–21, Institute of Electronics, Information, and Communication Engineering of Japan, 1996.
Q.-P. Gu, H Tamaki, Routing a permutation in the Hypercube by Two Sets of Edge-Disjoint Paths, Proc. of 10th International Parallel Processing Symposium (IPPS) (Apr. 1996), IEEE Computer Society Press.
M.G. Hluchyj, M.J. Karol, ShuffieNet: An Application of Generalized Perfect Shuffles to Multihop Lightwave Networks, Journal of Lightwave Technology, vol. 9, no. 10, Oct 91, pp. 1386–1396.
M. Imase, M. Itoh, Design to Minimize a Diameter on Building Block Network, TEEE Trans. on Computers, C-30, 1981, pp. 439–443.
M. Imase, M. Itoh, A Design for Directed Graph with Minimal Diameter, TEEE Trans. on Computers, C-32, 1983, pp. 782–784.
M. Imase, T. Soneoka, K. Okada, Connectivity of Regular Directed Graphs with Small Diameter, TEEE Trans. on Computers, C-34, 1985, pp. 267–273.
S. Irani. Coloring Inductive Graphs On-Line. Algorithmica, 11:53–72, 1994.
K. Jansen, Approximation Results for Wavelength Routing in Directed Trees, Proc. of WOCS (1997).
J.R. Jump, YACSIM Reference Manual, Department of Electrical And Computer Engineering, Rice University, 1.2 ed., August 1992.
C. Kaklamani, P. Persiano, T. Erlbach, K. Jansen, Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. ICALP’97.
W.H. Kautz, Bounds on directed (d, k) graphs, Theory of Cellur Logic Networks And Machines, AFCRL-68–0668 Final Report, 1968, pp. 20–28.
M. Kevacevic and M. Gerla, Rooted Routing in Linear Lightwave Networks, Proceedings of INFOCOM, pp. 39–48, 1992.
H. A. Kierstead and W. T. Trotter, An Extremal Problem in Recursive Combinatorics, Congressus Numerantium, 33:143–153, 1981.
J. Kleinberg and E. Tardos, Disjoint Paths in Densely Embedded Graphs, Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, pp. 52–61, 1995.
F.T. Leighton, S. Rao, An Approximate Max-flow Min-cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms, Proc. of 29th Annual Symposium on Foundations of Computer Science (FOCS) (Oct. 1988), IEEE, pp. 422–431.
R.A. Linke, Frequency Division Multiplexed Optical Networks Using Heterodyne Detection, IEEE Network Magazine, vol. 3, no. 2, Mar 1989, pp. 13–20.
M. Mihail, C. Kaklamanis, and S. Rao, Efficient Access to Optical Bandwidth, In Proc. of the of 36th Annual IEEE Symposium on Foundations of Computer Science, 1995.
R.K. Pankaj, Architecture for Linear Lightwave Networks, PhD thesis, MIT, 1992.
R.K. Pankaj, R. G. Gallager, Wavelength Requirements of All-Optical Networks, IEEE/ACM Trans. on Networking 3 (1995), pp. 269–280.
A. Pavan, S.-R. Tong, P.-J. Wan and D.H.C. Du, A New Multihop Lightwave Networks Based on a Generalized de Bruijn Graph, Proceedings of the 21st IEEE Annual Conference on Local Computer Networks, pp. 498–057, 1996.
G.R. Pieris and G.H. sasaki, A Linear Lightwave Benes Network, IEEE/ACM Trans. on Networking, 1993.
Y. Rabani, Path Coloring on the Mesh, Proc. of 37th Annual Symposium on Foundations of Computer Science (FOCS) (Oct. 1996), IEEE.
P. Raghavan and U. Upfal, Efficient Routing in All Optical Networks, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pp. 133–143, 1994.
S.M. Reddy, D.K. Pradhan, J.G. Kuhl, Directed Graphs with Minimal Diameter And Maximal Connectivity, School of Engineering Oakland Univ. Tech. Rep., 1980.
R. E. Tarjan, Decomposition by Clique Separators, Discrete Mathematics 55, 2 (1985), pp. 221–232.
A. Tucker, Coloring a Family of Circular Arcs, SIAM Journal of Applied Mathematics 29, 3 (1975), pp. 493–502.
P.-J. Wan and A. Pavan, TWDM Media Access Protocol for Singlehop Lightwave Networks, 21st Annual Conference on Local Computer Networks, pp. 486–490, 1996.
P.-J. Wan, TWDM Lightwave Hypercube Networks, Theoretical Computer Science, (194)1–2 (1998) pp. 123–136.
P.-J. Wan and A. Pavan, TWDM Lightwave Networks Based on Generalized de Bruijn Graphs, Dimacs Workshop on Network Design, April 1997.
P.-J. Wan, TWDM Lightwave Networks Based on Kautz Digraphs, Proceedings of the Fifth IEEE International Conference on Computer and Communication Networks, pp. 196–199, 1996.
P.-J. Wan, TWDM Lightwave Networks Based on Star Graphs, submitted to IEEE Transactions on Communications, 1997.
P.-J. Wan, TWDM Lightwave Networks Based on Rotator Digraphs, Proceedings of the Sixth IEEE International Conference on Computer and Communication Networks, pp. 154–157, 1997.
P.-J. Wan, Near-Optimal Conflict-free Channel Assignment for an Optical Cluster Hypercube Interconnection Network, Journal of Combinatorial Optimization 1, 179–186 (1997).
P.-J. Wan, Conflict-free Channel Assignment for an Optical Cluster Interconnection Network Based on Star Graphs, accepted by INFORMATICA,1997, also appearing in Proceeding of the Nineth LASTED International Conference on Parallel and Distributed Computing and Systems, 1997.
P.-J. Wan, Conflict-free Channel Assignment for an Optical Cluster Interconnection Network Based on Rotator Digraphs, Proceeding of the Eighth LASTED International Conference on Parallel and Distributed Computing and Systems, pp. 121–123, 1996.
P.-J. Wan, Multichannel Lightwave Networks, PhD thesis, Computer Science Department, University of Minnesota.
K.A. Williams, D.H.C. Du, Time and Wavelength Division Multiplexed Architectures for Optical Passive Stars Networks, Technical Report 92–44, Computer Science Dept., University of Minnesota.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Kluwer Academic Publishers
About this chapter
Cite this chapter
Wan, PJ. (1998). Optimization Problems in Optical Networks. In: Du, DZ., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0303-9_20
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0303-9_20
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7987-4
Online ISBN: 978-1-4613-0303-9
eBook Packages: Springer Book Archive