東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Design and optimization of packet sw...

Li, Lin.

FindBook

Google Book

Amazon

博客來

Design and optimization of packet switching and traffic grooming in WDM optical networks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Design and optimization of packet switching and traffic grooming in WDM optical networks./
作者:	Li, Lin.
面頁冊數:	89 p.
附註:	Source: Dissertation Abstracts International, Volume: 65-09, Section: B, page: 4670.
Contained By:	Dissertation Abstracts International65-09B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3147145
ISBN:	0496056514

Design and optimization of packet switching and traffic grooming in WDM optical networks.
Li, Lin.

Design and optimization of packet switching and traffic grooming in WDM optical networks. - 89 p.

Source: Dissertation Abstracts International, Volume: 65-09, Section: B, page: 4670.

Thesis (Ph.D.)--The University of Nebraska - Lincoln, 2004.

Optical packet switching is a long-term strategy to provide high-speed transmission, data transparency, and reconfigurability. Optical buffers are used in the switches to resolve contentions that occur whenever two packets are destined to the same output at the same time slot. Due to the lack of optical random access memory, fiber delay line (FDL) is currently the only way to implement optical buffering. In general, optical buffering structures can be categorized in two classes: feed-forward and feedback, both of which have advantages and disadvantages. In this research, we proposed a more effective hybrid buffering architecture that combines the merits of both schemes. It requires smaller optical device sizes and fewer wavelengths and has less noise than feedback architecture. At the same time, it can facilitate preemptive priority routing which feed-forward architecture cannot support. Based on this architecture, we described two switch designs---single plane and multiple plane. The numerical results showed that the new switch architecture can significantly reduce the packet loss probability.

ISBN: 0496056514Subjects--Topical Terms:

626642
Computer Science.

Design and optimization of packet switching and traffic grooming in WDM optical networks.
LDR:03195nmm 2200301 4500 001 1851433
005 20051216110258.5
008 130614s2004 eng d
020 $a 0496056514
035 $a (UnM)AAI3147145
035 $a AAI3147145
040 $a UnM $c UnM
100 1 $a Li, Lin. $3 1020924
245 1 0 $a Design and optimization of packet switching and traffic grooming in WDM optical networks.
300 $a 89 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-09, Section: B, page: 4670.
500 $a Supervisors: Stephen D. Scott; Jitender S. Deogun.
502 $a Thesis (Ph.D.)--The University of Nebraska - Lincoln, 2004.
520 $a Optical packet switching is a long-term strategy to provide high-speed transmission, data transparency, and reconfigurability. Optical buffers are used in the switches to resolve contentions that occur whenever two packets are destined to the same output at the same time slot. Due to the lack of optical random access memory, fiber delay line (FDL) is currently the only way to implement optical buffering. In general, optical buffering structures can be categorized in two classes: feed-forward and feedback, both of which have advantages and disadvantages. In this research, we proposed a more effective hybrid buffering architecture that combines the merits of both schemes. It requires smaller optical device sizes and fewer wavelengths and has less noise than feedback architecture. At the same time, it can facilitate preemptive priority routing which feed-forward architecture cannot support. Based on this architecture, we described two switch designs---single plane and multiple plane. The numerical results showed that the new switch architecture can significantly reduce the packet loss probability.
520 $a The objective of traffic grooming is to save electronics cost by effectively assigning low-rate circuits onto high-speed channels. Generally, we can treat the traffic grooming problem as two steps: circuit construction and circuit grooming. In this research, we focused on developing efficient algorithms for circuit construction. Two heuristics based on Random Hill-climber and Simulated Annealing were proposed. Our algorithms are more aggressive in splitting the connections to achieve efficient circuit construction. Numerical results showed that the algorithms have good performance in reducing the low-rate circuit number and end node number.
520 $a We also studied the problem of weighted edge-decompositions of graphs which is related to circuit grooming. The research was focused on grooming symmetric traffic that we can always construct full low-rate circuits. The objective is to minimize the number of add/drop multiplexers by using the minimum number of wavelengths. Through numerical estimates, we obtained useful tight bounds of some special cases of k-decompositions of a graph.
590 $a School code: 0138.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a The University of Nebraska - Lincoln. $3 1024939
773 0 $t Dissertation Abstracts International $g 65-09B.
790 1 0 $a Scott, Stephen D., $e advisor
790 1 0 $a Deogun, Jitender S., $e advisor
790 $a 0138
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3147145