Fallacious node algorithm for performance enhancement in optical-burst-switching networks

被引:5
|
作者
Saini H.S. [1 ]
Wason A. [2 ]
机构
[1] Indo Global College of Engineering, Abhipur, New Chandigarh
[2] Ambala College of Engineering and Applied Research, Ambala, Haryana
来源
Journal of Optical Communications | 2019年 / 40卷 / 03期
关键词
assignment and routing algorithms; blocking probability; congestion; fallacious node; fiber optics communications; OBS network;
D O I
10.1515/joc-2017-0078
中图分类号
学科分类号
摘要
In this paper, fallacious node algorithm is formulated for performance enhancement of an optical-burst-switching (OBS) network. With the procedural and observational analysis, we have demonstrated that the blocking probability is extremely unnoticeable, during a call establishment, while collectively discarding the faulty nodes from the selected paths. There may be distinguishing values of blocking probability because of random value of congestion on each path. The blocking probability is restrained so as not to be more than 10% on several values on traffic and congestion. The blocking probability diminishes and becomes imperceptible with the incorporation of fallacious node algorithm and subsequently the performance of optical network is highly aggrandized. Thus the fallacious node algorithm manifests incredible prospects for optical networks as the key features such as the accessibility; sustainability and reliability of the network are highly appreciated and upgraded. © 2019 Walter de Gruyter GmbH, Berlin/Boston.
引用
收藏
页码:239 / 245
页数:6
相关论文
共 50 条
  • [31] Performance Evaluation of a WDM Optical Network Node with Wavelength Convertible Optical Burst Switching
    Akhter, Rumana
    Majumder, Satya Prasad
    2018 INTERNATIONAL CONFERENCE ON SMART COMPUTING AND ELECTRONIC ENTERPRISE (ICSCEE), 2018,
  • [32] A QoS supporting scheduling algorithm for optical burst switching DWDM networks
    Yang, M
    Zheng, SQ
    Verchere, D
    GLOBECOM '01: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2001, : 86 - 91
  • [33] Best Fit Void Filling Algorithm in Optical Burst Switching Networks
    Nandi, M.
    Turuk, A. K.
    Puthal, D. K.
    Dutta, S.
    2009 SECOND INTERNATIONAL CONFERENCE ON EMERGING TRENDS IN ENGINEERING AND TECHNOLOGY (ICETET 2009), 2009, : 264 - 269
  • [34] A new routing algorithm based on priority in optical burst switching networks
    Ai-Hong, Guan
    Bo-Yun, Wang
    International Journal of Digital Content Technology and its Applications, 2012, 6 (17) : 402 - 409
  • [35] Optical amplifier for optical burst switching networks
    Ennser, K.
    Zannin, M.
    Taccheo, S.
    Careglio, D.
    Sole-Pareta, J.
    Aracil, J.
    ICTON 2008: PROCEEDINGS OF 2008 10TH ANNIVERSARY INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS, VOL 1, 2008, : 190 - +
  • [36] Provision of differentiated performance in Optical Burst Switching networks based on burst assembly processes
    Jin, Mushi
    Yang, Oliver W. W.
    COMPUTER COMMUNICATIONS, 2007, 30 (18) : 3449 - 3459
  • [37] A new burst scheduling algorithm for edge/core node combined optical burst switched networks
    Lee, SeoungYoung
    Hwang, InYong
    Park, HongShik
    NETWORKING 2006: NETWORKING TECHNOLOGIES, SERVICES, AND PROTOCOLS; PERFORMANCE OF COMPUTER AND COMMUNICATION NETWORKS; MOBILE AND WIRELESS COMMUNICATIONS SYSTEMS, 2006, 3976 : 1240 - 1245
  • [38] Performance analysis of scheduling algorithm based on self-similar traffic in optical burst switching networks
    Wang, Ru-Yan
    Wu, Da-Peng
    Long, Ke-Ping
    Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2008, 30 (08): : 1989 - 1993
  • [39] Performance simulation and hardware implement of the edge node in optical burst switching network
    Le, Zichun
    Fu, Minglei
    Zhu, Zhijun
    Hongwai yu Jiguang Gongcheng/Infrared and Laser Engineering, 2011, 40 (05): : 926 - 930
  • [40] Performance analysis of optical burst switching node with limited wavelength conversion capabilities
    Xu Yi
    Shi Kai-yuan
    Fan Ge
    JOURNAL OF CENTRAL SOUTH UNIVERSITY OF TECHNOLOGY, 2009, 16 (05): : 794 - 801