Generalized survivable network.

A comprehensive framework has been developed for designing a GSN. The focus of this thesis is the capacity planning problem which finds the edge capacities for a given physical topology with specifications of the I/O constraints at the nodes. Two kinds of GSN are studied: (1) For the design of a Wid...

Full description

Bibliographic Details
Other Authors: Ho, Kwok-shing.
Format: Others
Language:English
Chinese
Published: 2006
Subjects:
Online Access:http://library.cuhk.edu.hk/record=b6074291
http://repository.lib.cuhk.edu.hk/en/item/cuhk-343920
id ndltd-cuhk.edu.hk-oai-cuhk-dr-cuhk_343920
record_format oai_dc
spelling ndltd-cuhk.edu.hk-oai-cuhk-dr-cuhk_3439202019-02-19T03:42:24Z Generalized survivable network. CUHK electronic theses & dissertations collection Computer networks--Reliability Optical communications A comprehensive framework has been developed for designing a GSN. The focus of this thesis is the capacity planning problem which finds the edge capacities for a given physical topology with specifications of the I/O constraints at the nodes. Two kinds of GSN are studied: (1) For the design of a Wide-Sense Non-Blocking GSN (WSNB-GSN), a rigorous mathematical framework is presented. Duality transformation technique that transforms the initial, infinite and infeasible mathematical formulation into a finite feasible formulation is shown. A procedure for finding the realizable lower bound of the cost of a WSNB-GSN is presented and two different solution approaches are proposed. (2) For the design of a Rearrangeably Non-Blocking GSN (RNB-GSN), a straightforward mathematical formulation is presented first. A procedure using the cut condition to find the lower bound of the cost of a RNB-GSN with a general topology is shown then. The optimal solution in the design of a RNB-GSN with an unlimited-size ring topology is demonstrated with a theorem. Dynamic bandwidth provisioning and full survivability against link failures are two of the most important requirements for future optical networks. Since previous methodologies could not deal with these two issues simultaneously, a new survivable network concept called the "Generalized Survivable Network" (GSN) is proposed. Generalized Survivable Network incorporates the non-blocking network concept into the survivable network design. Here, "generalized" means the generalization of a network from satisfying a single demand matrix to satisfying the set of all allowable demand matrices under the Input and Output (I/O) access capacity constraints at the network nodes. Numerical experiments have been carried out to verify the performance of GSN. It is demonstrated that the deploying cost of a WSNB-GSN is within a factor of 2 compared with that of a random sample of a single-period survivable network. The cost of building a RNB-GSN with a ring topology is shown to be about 14% to 45% less than that of building a WSNB-GSN. The framework for planning a GSN is applicable to network planning for future optical networks and survivable IP networks. Ho Kwok-shing. "September 2006." Adviser: Cheung Kwok Wai. Source: Dissertation Abstracts International, Volume: 68-03, Section: B, page: 1823. Thesis (Ph.D.)--Chinese University of Hong Kong, 2006. Includes bibliographical references (p. 118-124). Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. Abstracts in English and Chinese. School code: 1307. Ho, Kwok-shing. Chinese University of Hong Kong Graduate School. Division of Information Engineering. 2006 Text theses electronic resource microform microfiche 1 online resource (ix, 124 p. : ill.) cuhk:343920 http://library.cuhk.edu.hk/record=b6074291 eng chi Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) http://repository.lib.cuhk.edu.hk/en/islandora/object/cuhk%3A343920/datastream/TN/view/Generalized%20survivable%20network.jpghttp://repository.lib.cuhk.edu.hk/en/item/cuhk-343920
collection NDLTD
language English
Chinese
format Others
sources NDLTD
topic Computer networks--Reliability
Optical communications
spellingShingle Computer networks--Reliability
Optical communications
Generalized survivable network.
description A comprehensive framework has been developed for designing a GSN. The focus of this thesis is the capacity planning problem which finds the edge capacities for a given physical topology with specifications of the I/O constraints at the nodes. Two kinds of GSN are studied: (1) For the design of a Wide-Sense Non-Blocking GSN (WSNB-GSN), a rigorous mathematical framework is presented. Duality transformation technique that transforms the initial, infinite and infeasible mathematical formulation into a finite feasible formulation is shown. A procedure for finding the realizable lower bound of the cost of a WSNB-GSN is presented and two different solution approaches are proposed. (2) For the design of a Rearrangeably Non-Blocking GSN (RNB-GSN), a straightforward mathematical formulation is presented first. A procedure using the cut condition to find the lower bound of the cost of a RNB-GSN with a general topology is shown then. The optimal solution in the design of a RNB-GSN with an unlimited-size ring topology is demonstrated with a theorem. === Dynamic bandwidth provisioning and full survivability against link failures are two of the most important requirements for future optical networks. Since previous methodologies could not deal with these two issues simultaneously, a new survivable network concept called the "Generalized Survivable Network" (GSN) is proposed. Generalized Survivable Network incorporates the non-blocking network concept into the survivable network design. Here, "generalized" means the generalization of a network from satisfying a single demand matrix to satisfying the set of all allowable demand matrices under the Input and Output (I/O) access capacity constraints at the network nodes. === Numerical experiments have been carried out to verify the performance of GSN. It is demonstrated that the deploying cost of a WSNB-GSN is within a factor of 2 compared with that of a random sample of a single-period survivable network. The cost of building a RNB-GSN with a ring topology is shown to be about 14% to 45% less than that of building a WSNB-GSN. The framework for planning a GSN is applicable to network planning for future optical networks and survivable IP networks. === Ho Kwok-shing. === "September 2006." === Adviser: Cheung Kwok Wai. === Source: Dissertation Abstracts International, Volume: 68-03, Section: B, page: 1823. === Thesis (Ph.D.)--Chinese University of Hong Kong, 2006. === Includes bibliographical references (p. 118-124). === Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. === Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. === Abstracts in English and Chinese. === School code: 1307.
author2 Ho, Kwok-shing.
author_facet Ho, Kwok-shing.
title Generalized survivable network.
title_short Generalized survivable network.
title_full Generalized survivable network.
title_fullStr Generalized survivable network.
title_full_unstemmed Generalized survivable network.
title_sort generalized survivable network.
publishDate 2006
url http://library.cuhk.edu.hk/record=b6074291
http://repository.lib.cuhk.edu.hk/en/item/cuhk-343920
_version_ 1718977900374392832