Traffic Rate Matrix Decomposition Based Conflict Free Scheduling for a Fast Optical Switching Network

2021 ◽  
Author(s):  
Fulong Yan ◽  
Chongjin Xie ◽  
Nicola Calabretta
2010 ◽  
Vol 47 (6) ◽  
pp. 060602
Author(s):  
张瑾 Zhang Jin ◽  
徐世中 Xu Shizhong ◽  
王晟 Wang Sheng ◽  
王雄 Wang Xiong

2010 ◽  
Vol 47 (5) ◽  
pp. 050601
Author(s):  
易厚梅 Yi Houmei ◽  
徐世中 Xu Shizhong ◽  
王晟 Wang Sheng ◽  
王雄 Wang Xiong

Author(s):  
Md. Mahmudur Rahman ◽  
Md. Afzal Hossan ◽  
M. M. Hafizur Rahman ◽  
Susumu Horiguchi

1993 ◽  
Author(s):  
Seiichi Shirai ◽  
Kazuo Kimura ◽  
Yukio Irita ◽  
Noboru Naito ◽  
Tadashi Serikawa ◽  
...  

In optical switching networks, optical information (packets/bursts) that are forwarded from an optical switch to another through the network could entering a queue of a certain length in each node and may be waiting inside this node before it will be transmitted to the next node. Various queueing models have been widely applied as the main tool in optical switching networks for modeling and performance evaluation analysis of the switching nodes. In this paper, studying the performance analysis of an optical switching node is discussed at Finite and Infinite queueing models to have the optimum queueing model for optical core node switch design. The waiting delay time, the average expected number of optical packets and the loss probability of packets in the optical switch are estimated at variable traffic loads and different wavelength channels.


Sign in / Sign up

Export Citation Format

Share Document