Ma, Xiao
(2012)
Using Graph Enumeration and Topography Reasoning to Analyze Blocking in WDM Networks Without Wavelength Interchange.
Master's Thesis, University of Pittsburgh.
This is the latest version of this item.
Abstract
This thesis presents techniques and analysis results which look promising for analyzing blocking in WDM networks without wavelength interchange (WLI). The approach includes two parts—graph enumeration and blocking analysis for graphs, which are linked by a theorem [1] that reduces blocking analysis for an entire WDM system to the blocking analysis of the backbone topography and link capacity. Graph enumeration utilizes Burnside’s Theorem and MATLAB computation. Blocking analysis for graphs are implemented in MATLAB. Some general phenomena are observed from the analysis result of graphs with four, five, and six nodes. Node resilience is also discussed.
Share
Citation/Export: |
|
Social Networking: |
|
Details
Item Type: |
Other Thesis, Dissertation, or Long Paper
(Master's Thesis)
|
Status: |
Unpublished |
Creators/Authors: |
|
Contributors: |
Contribution | Contributors Name | Email | Pitt Username | ORCID |
---|
Director | Thompson, Richard | rthompso@pitt.edu | RTHOMPSO | UNSPECIFIED |
|
Date: |
2 August 2012 |
Date Type: |
Publication |
Access Restriction: |
No restriction; Release the ETD for access worldwide immediately. |
Publisher: |
University of Pittsburgh |
Institution: |
University of Pittsburgh |
Schools and Programs: |
School of Information Sciences > Telecommunications |
Degree: |
MS - Master of Science |
Thesis Type: |
Master's Thesis |
Refereed: |
Yes |
Date Deposited: |
10 Sep 2012 14:05 |
Last Modified: |
14 Mar 2021 08:57 |
URI: |
http://d-scholarship.pitt.edu/id/eprint/13931 |
Available Versions of this Item
Metrics
Monthly Views for the past 3 years
Plum Analytics
Actions (login required)
|
View Item |