Timeslot-Sharing Algorithm with a Dynamic Grouping for WDM

uTaipei > College of Science > Department of Computer Science > Periodical Articles > Item 987654321/2715

Please use this identifier to cite or link to this item: http://utaipeir.lib.utaipei.edu.tw/dspace/handle/987654321/2715

Title:	Timeslot-Sharing Algorithm with a Dynamic Grouping for WDM
Authors:	Jyh-Horng Wen Kuo-Ting Huang Cheng-Ying Yang Tzu-Chen Tsai 楊政穎溫志宏
Contributors:	臺北市立教育大學資訊科學系
Keywords:	WDM broadcast-and-select network all-to-all transmission schedule system performance timeslot-sharing algorithm traffic matrix
Date:	2006
Issue Date:	2009-08-04 12:47:49 (UTC+8)
Abstract:	The all-to-all transmission schedule is suitable for Wavelength division multiplexing (WDM) broadcast-and-select star networks under uniform traffic patterns. The performance suffers degradation under non-uniform traffic conditions. The timeslot-sharing algorithm with a dynamic grouping is proposed to decrease the degradation under the non-uniform traffic matrices. According to a given traffic matrix, the algorithm decomposes the given traffic matrix into a transmission matrix and a residual matrix. The algorithm aims to obtain a transmission matrix with most entries and to approach a uniform traffic matrix. Also, its complexity is evaluated. In the simulations, the system with the proposed algorithm provides a superior performance based on throughput, packet delay and node's buffer size. The results show that the algorithm is an efficient solution to improve the performance under uniform and non-uniform traffic distributions.
Relation:	Journal of Systems and Software, V79(8), P.1110 - 1119
Appears in Collections:	[Department of Computer Science] Periodical Articles

Files in This Item:

There are no files associated with this item.