2026-09-19T20:22:11Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/24261 2023-07-10 col_2142_8888 col_2142_5131 com_2142_8887 com_2142_234 com_2142_5130

Generalized Multi-protocol Label Switching (GMPLS) dynamic wavelength service network dimensioning online routing network heuristic optimization Lumetta, Steven S. Lumetta, Steven S. Hajek, Bruce Patel, Sanjay J. Nahrstedt, Klara Zhang, Xiaolan 2011-05-25T14:52:32Z 2011-05-25T14:52:32Z 2011-05-25T14:52:32Z 2011-05 The ability of core networks to manage data transmission of increasing volume and variation is critical for the success of data-intensive and network-centric applications as they grow in both scale and complexity. Traditionally, static optical networks were the dominant transport for medium and long distance communication. However, these networks can no longer meet the needs of tomorrow's applications for higher bandwidth at lower cost. New dynamic optical networks greatly improve the reconfigurability of optical terminal systems and support unprecedented flexibility for high-traffic resource sharing. However, managing dynamic networks poses challenging problems related to scale and traffic volume. Traditional analytical techniques, which rely heavily on simplification of network topologies and route choices, are insufficient to understand the significant performance differences implied by the subtle path preferences of dynamic routing algorithms. This dissertation presents an integrated approach to efficient and robust resource management algorithms for on-demand data traffic on dynamic photonic switching networks. First, a resource management framework is proposed to consider both resource dimensioning and routing for optical opaque networks. I develop dimensioning and routing algorithms that are efficient to implement and robust to evolutions of traffic load, network topology, and scale. Second, using Poisson traffic assumptions, the thesis develops an opportunity cost model for analyzing threshold-based dynamic routing algorithms. The model is scalable and provides better congestion management than previous work. Third, applying the dimensioning technique developed in this thesis, I have several important findings on managing dynamically routed optical translucent networks, optical restorable networks, and multiple optical network domains. Finally, the thesis solves a combinatorial optimization provisioning problem for a dynamic wavelength service traffic model on an optical translucent network. This work is the first to evaluate the robustness of optical route rearrangement. New solutions are proposed to design an optimal dynamic service network with rerouting capability. Item withdrawn by Rebecca Bryant (rabryant@illinois.edu) on 2011-04-20T21:55:33Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Zhang_Xiaolan.pdf: 1802805 bytes, checksum: d9930b695ae641d4bc35052e19c84855 (MD5) Made available in DSpace on 2011-05-25T14:52:32Z (GMT). No. of bitstreams: 2 Zhang_Xiaolan.pdf: 1802569 bytes, checksum: 8147b9a8e897a0615478d49cb824d1d5 (MD5) license.txt: 4063 bytes, checksum: 3009d03150eac696b17091895fb32253 (MD5) http://hdl.handle.net/2142/24261 en Copyright 2011 Xiaolan Zhang optical networks resource management wavelength-division multiplexing (WDM) reconfigurable optical add-drop multiplexer (ROADM) route provisioning dynamic routing wavelength routing optical bridge and roll multi-domain restoration translucent optical networks Resource management for dynamic optical networks Electrical & Computer Eng 1933 Electrical & Computer Engr 1200 University of Illinois at Urbana-Champaign Dissertation Ph.D. PHD:Electr & Computer Eng-UIUC 10KS1200PHD