東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

A Non-Blocking Design Paradigm for W...

Ma, Xiao.

FindBook

Google Book

Amazon

博客來

A Non-Blocking Design Paradigm for WDM Mesh Backbone Networks and its Performance Analysis.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	A Non-Blocking Design Paradigm for WDM Mesh Backbone Networks and its Performance Analysis./
作者:	Ma, Xiao.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2018,
面頁冊數:	185 p.
附註:	Source: Dissertations Abstracts International, Volume: 80-02, Section: A.
Contained By:	Dissertations Abstracts International80-02A.
標題:	Technical Communication. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10984388
ISBN:	9780438364479

A Non-Blocking Design Paradigm for WDM Mesh Backbone Networks and its Performance Analysis.
Ma, Xiao.

A Non-Blocking Design Paradigm for WDM Mesh Backbone Networks and its Performance Analysis. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 185 p.

Source: Dissertations Abstracts International, Volume: 80-02, Section: A.

Thesis (Ph.D.)--University of Pittsburgh, 2018.

This item must not be sold to any third party vendors.

Current network design problems can be solved by offline or online methods. Offline methods are criticized for their complexity and in flexibility, whereas online methods lack guaranteed optimality. Non-blocking properties, which are typically studied in switching structures, could be used to evaluate the capability of a switching structure to handle dynamic traffic. This dissertation extends the study of non-blocking networks to general-connected mesh WDM backbone networks. This study begins by finding that a set of special graphs have certain non-blocking properties, and that non-blocking routing algorithms can be designed to be implemented in a distributable manner without a central decision system. The in-depth philosophy of this research is to investigate the relationship among these non-blocking properties, the topography of the network, and the power of these distributed routing algorithms. This design paradigm is illustrated by applying it to a potential implementation for NSFNet. After confirming that NSFNet is NOT non-blocking, we propose a virtual topography that makes NSFNet virtually non-blocking, along with system diagrams for the node structures and the discussion of the implementation framework. To evaluate the performance of the non-blocking algorithms, we compare the performance of our proposed online algorithm with other algorithms in a general traffic scenario.

ISBN: 9780438364479Subjects--Topical Terms:

1669287
Technical Communication.

A Non-Blocking Design Paradigm for WDM Mesh Backbone Networks and its Performance Analysis.
LDR:02532nmm a2200325 4500 001 2207844
005 20190923114241.5
008 201008s2018 ||||||||||||||||| ||eng d
020 $a 9780438364479
035 $a (MiAaPQ)AAI10984388
035 $a AAI10984388
040 $a MiAaPQ $c MiAaPQ
100 1 $a Ma, Xiao. $3 3434845
245 1 0 $a A Non-Blocking Design Paradigm for WDM Mesh Backbone Networks and its Performance Analysis.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 185 p.
500 $a Source: Dissertations Abstracts International, Volume: 80-02, Section: A.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Thompson, Richard.
502 $a Thesis (Ph.D.)--University of Pittsburgh, 2018.
506 $a This item must not be sold to any third party vendors.
506 $a This item must not be added to any third party search indexes.
520 $a Current network design problems can be solved by offline or online methods. Offline methods are criticized for their complexity and in flexibility, whereas online methods lack guaranteed optimality. Non-blocking properties, which are typically studied in switching structures, could be used to evaluate the capability of a switching structure to handle dynamic traffic. This dissertation extends the study of non-blocking networks to general-connected mesh WDM backbone networks. This study begins by finding that a set of special graphs have certain non-blocking properties, and that non-blocking routing algorithms can be designed to be implemented in a distributable manner without a central decision system. The in-depth philosophy of this research is to investigate the relationship among these non-blocking properties, the topography of the network, and the power of these distributed routing algorithms. This design paradigm is illustrated by applying it to a potential implementation for NSFNet. After confirming that NSFNet is NOT non-blocking, we propose a virtual topography that makes NSFNet virtually non-blocking, along with system diagrams for the node structures and the discussion of the implementation framework. To evaluate the performance of the non-blocking algorithms, we compare the performance of our proposed online algorithm with other algorithms in a general traffic scenario.
590 $a School code: 0178.
650 4 $a Technical Communication. $3 1669287
650 4 $a Information science. $3 554358
690 $a 0643
690 $a 0723
710 2 $a University of Pittsburgh. $b Telecommunications. $3 3434846
773 0 $t Dissertations Abstracts International $g 80-02A.
790 $a 0178
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10984388