کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
11012459 | 1798989 | 2018 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Constraint-based scheduling algorithm with the non-adjacency requirement for multi-flow AWG switches
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Conventional constraint-based scheduling algorithms have two limitations. First, they assume each input (output) port can only send (receive) one flow. This significantly limits the total capacity of the switch as an Nâ¯Ãâ¯N AWG can support N flows from each port simultaneously. Second, they assume that two signals of the same wavelength have the same crosstalk effect. But in fact, the crosstalk generated by signals of non-adjacent channels is much weaker than that by adjacent channels. In this paper, we propose a new constraint-based scheduling algorithm that overcomes these two limitations and can achieve significant performance gains.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Network and Computer Applications - Volume 124, 15 December 2018, Pages 158-168
Journal: Journal of Network and Computer Applications - Volume 124, 15 December 2018, Pages 158-168
نویسندگان
Shuyue Chen, Chin-Tau Lea,