IDEAS home Printed from https://ideas.repec.org/a/hin/jjmath/3806018.html
   My bibliography  Save this article

Dynamic Wavelength Scheduling by Multiobjectives in OBS Networks

Author

Listed:
  • V. Kishen Ajay Kumar
  • M. Rudra Kumar
  • N. Shribala
  • Ninni Singh
  • Vinit Kumar Gunjan
  • Kazy Noor-e-alam Siddiquee
  • Muhammad Arif
  • Naeem Jan

Abstract

The burst dropping ratio is witnessed in the contemporary literature as a considerable constraint of optical burst switching (OBS) networks that attained many researchers’ efforts in the recent past. Among the multiple practices endeavoring to reduce the burst drop ratio, the optimal burst scheduling is one dimension in this regard. The transmission channel scheduling and appropriate wavelength allocation are critical objectives to achieve optimal burst scheduling in regard to minimal burst drop ratio. Many of the scheduling models depicted in the contemporary literature aimed to achieve the optimum scheduling by electing the channels, which depend on optimum utilization of idle time. Some of the studies tried to select channels by any metrics of quality, and significantly minimal amount of studies focused on wavelength allocation for lowering BDR. Moreover, in regard to this, this study tried to achieve optimum wavelength allocation beneath manifold objective QoS metrics, which is identified as “multiobjective dynamic wavelength scheduling (DyWaS).†The experimental study carried through the simulations evinced that the proposed model DyWaS escalated the optimality of burst scheduling through wavelength allocation compared with other existing methods represented in the contemporary literature.

Suggested Citation

  • V. Kishen Ajay Kumar & M. Rudra Kumar & N. Shribala & Ninni Singh & Vinit Kumar Gunjan & Kazy Noor-e-alam Siddiquee & Muhammad Arif & Naeem Jan, 2022. "Dynamic Wavelength Scheduling by Multiobjectives in OBS Networks," Journal of Mathematics, Hindawi, vol. 2022, pages 1-10, April.
  • Handle: RePEc:hin:jjmath:3806018
    DOI: 10.1155/2022/3806018
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/jmath/2022/3806018.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/jmath/2022/3806018.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/3806018?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jjmath:3806018. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.